NFA with € to NFA without €

conversion
 Epsilon Transition
• NFA with ∈ move : If any finite automata
contains ε (null) move or transaction, then
that finite automata is called NFA with ∈
moves
• ∈ transition means moving from one state to
another state without any input symbol
 Need
• Nfa with epsilon will take more time while
reach final state or accepting strings. But NFA
without epsilon will always take less time to
reach final state or to accept final state.
 Epsilon (∈) – closure
• Epsilon (∈) – closure : Epsilon closure for a
given state X is defined as a set of states
which can be reached from the states X with
only ε moves including the state X itself.
 Epsilon (∈) – closure

For the above example ∈ closure are as follows :

• ∈ closure(A) : {A, B, C}
• ∈ closure(B) : {B, C}
• ∈ closure(C) : {C}