Eliminating ε TransitionsNFA with ε can be converted to NFA without ε, and this NFA without ε can be converted to DFA. To do this, we will use a method, which can remove all the ε transition from given NFA. The method will be:
Example:Convert the following NFA with ε to NFA without ε. Solutions: We will first obtain εclosures of q0, q1 and q2 as follows: Now the δ' transition on each input symbol is obtained as: Now the δ' transition on q1 is obtained as: The δ' transition on q2 is obtained as: Now we will summarize all the computed δ' transitions: The transition table can be:
State q1 and q2 become the final state as εclosure of q1 and q2 contain the final state q2. The NFA can be shown by the following transition diagram:
Next TopicConversion from NFA to DFA
