Given a Non-deterministic Finite Automation (NFA) with states p and r as…

PYQ UGC NET 2013Modified — slightly modified from the official paper; see the solution

Given a Non-deterministic Finite

Automation (NFA) with states p and r

as initial and final states respectively

and transition table as given below :

a

b

p

–

q

q

r

s

r

r

s

s

r

s

The minimum number of states

required in Deterministic Finite

Automation (DFA) equivalent to

NFA is

image.png
  1. A.

    5

  2. B.

    4

  3. C.

    3

  4. D.

    2

Attempted by 107 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…