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

Since the start state q0 must be final state in the equivalent NFA .

Since and and we add moves and in the equivalent NFA . Other moves are also constructed accordingly.

-closures:

The concept used in the above construction can be made more formal by defining the -closure for a state (or a set of states). The idea of -closure is that, when moving from a state p to a state q (or from a set of states Si to a set of states Sj ) an input , we need to take account of all -moves that could be made after the transition. Formally, for a given state q,

-closures:

Similarly, for a given set

-closures:

First   |   Last   |   Prev   |   Next