Convert the following NFA to an equivalent DFA

3.4kviews

written 8.7 years ago by

teamques10 ★ 70k

• modified 3.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

42views

written 8.7 years ago by

teamques10 ★ 70k

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

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.