NFA - Λ A nondeterministic finite automaton with Λ-transitions (NFA- Λ) is a 5-tuple M=(Q,Σ,q0,A,δ) where Q and Σ are finite sets, q0 ∈ Q, A⊆Q and δ : Q × (ΣÚ{Λ})->2^Q Conversion from NFA- ^ to NFA and NFA to FA
