0
2.8kviews
Convert the following NFA to an equivalent DFA

Mumbai University > Computer Engineering > Sem 4 > Theoretical Computer Science

Marks: 10M

Year: Dec 2016

1 Answer
0
37views

enter image description here

Solution: The DFA equivalent to NFA given above will be:

enter image description here

Where {q0} correspond to the initial state of the automata, and the state marked as * are final state. If we rename the state as follows:

enter image description here

Then the transition table will be

enter image description here

Please log in to add an answer.