TOC : FINITE AUTOMATA WITH EPSILON MOVES | Class-9

 FINITE AUTOMATA ( FA ) with ε (Epsilon) is a set of five tuples  ( Q , Σ ,  δ ,  q₀  , F ).

  where :  Q   is a set of states
                 Σ (Sigma)  is a set of Input symbols
                 δ  (Delta)   is a transition function / mapping
                 q₀  is a Initial state
                 F   is a set of final states.

    δ : ( Q U Σ ) → 2^Q

    δ : Q x ( ε U Σ ) → 2^Q   { Since ε is not a member of Σ }

 It is NDFA with ε (Epsilon) because it gives many output like { q2, q3, q4 } etc.