538 views
2 votes
2 votes

Consider the following NFA

Number of states in the equivalent minimal DFA is_________????

(Note: Count one for the dead state (if required))

2 Answers

0 votes
0 votes
NFA to DFA conversion transition table

             input alphabets/states

          a           b
            {1}              {1,2,3}     TRAP

          {1,2,3}

             {1,2,3}      {1,2,3}

So there are Three states including 1 TRAP state.

No related questions found