Ask
Login
0
3.0kviews
Convert the following NFA to an equivalent DFA
written 7.7 years ago by gravatar for teamques10 teamques10 ★ 67k •   modified 2.8 years ago

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

Marks: 10M

Year: Dec 2016
theory of computation
ADD COMMENT EDIT
1 Answer
0
41views
written 7.7 years ago by gravatar for teamques10 teamques10 ★ 67k

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
ADD COMMENT EDIT
Please log in to add an answer.