Minimal deterministic finite automaton for the language \(L=\{0^n \mid n \geq…
PYQ UGC NET 2015
Minimal deterministic finite automaton for the language will have :
- A.
1 final state among 5 states
- B.
4 final states among 5 states
- C.
1 final state among 6 states
- D.
5 final states among 6 states
Attempted by 170 students.
Sign up free to check your answer
Sign up freeLoading lesson…

