Removing Transition
Print this page
First   |   Last   |   Prev   |   Next
                                                                                           

                                                                                                                   Transition table   

0
1
{}

 Since there are 3 states in the NFA

There will be states (representing all possible subset of states) in the equivalent DFA . The transition table of the DFA constructed by using the subset constructions process is produced here.

First   |   Last   |   Prev   |   Next