What is the minimum number of states in a non-deterministic finite automaton that accepts L?
-
-
set2018
- 3 years 2 days
-
-
-
- 4
- Answer
Palindromes are Regular Language
-
-
Shraddha
- 3 years 6 months
-
-
-
- 2
- Likes
-
- 11
- Answer
comparing regular language and LL(1)
-
-
rachapalli vinay kumar
- 3 years 7 months
-
-
-
- 4
- Answer
equal no. of occurences of string in DFA
-
-
Rahul
- 3 years 8 months
-
-
-
- 1
- Answer
How first third of A is regular -
-
-
sumit
- 3 years 9 months
-
-
-
- 0
- Answer
Non deterministic finite automata
-
-
Hradesh
- 3 years 10 months
-
-
-
- 0
- Answer
Regularity of languages
-
-
Hradesh
- 3 years 10 months
-
-
-
- 1
- Likes
-
- 6
- Answer
Regular Language
-
-
lucky
- 4 years 6 months
-
-
-
- 2
- Likes
-
- 10
- Answer
minimum state in DFA
-
-
meet
- 4 years 6 months
-
-
-
- 2
- Answer
Which of the following is a non regular language?
-
-
lucky
- 4 years 6 months
-
-
-
- 9
- Answer