The number of states in a minimal deterministic finite automaton corresponding…
PYQ UGC NET 2013
The number of states in a minimal deterministic finite automaton corresponding to the language L = { an | n≥4 } is
- A.
3
- B.
4
- C.
5
- D.
6
Attempted by 38 students.
Sign up free to check your answer
Sign up freeLoading lesson…

