The minimum number of states of the non-deterministic finite automation which…

PYQ UGC NET 2012

The minimum number of states of the non-deterministic finite automation which accepts the language {ababn | n ≥ 0} ∪ {aban | n ≥ 0} is:

  1. A.

    3

  2. B.

    4

  3. C.

    5

  4. D.

    6

Attempted by 79 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…