Minimal deterministic finite automaton for the language \(L=\{0^n \mid n \geq…

PYQ UGC NET 2015

Minimal deterministic finite automaton for the language L={0n∣n≥0,n≠4}L=\{0^n \mid n \geq 0, n \neq 4 \} will have :

  1. A.

    1 final state among 5 states

  2. B.

    4 final states among 5 states

  3. C.

    1 final state among 6 states

  4. D.

    5 final states among 6 states

Attempted by 170 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…