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