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

  1. A.

    3

  2. B.

    4

  3. C.

    5

  4. D.

    6

Attempted by 38 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…