Home > Theory Of Computation > NFA With ε-Moves Or ε-NFA

NFA With ε-Moves Or ε-NFA

NFA With ε-Moves Or ε-NFA

The NFA Which Has Transition Even For Empty String ε Is The Called An ε-nfa

ε-NFA Has 5-Tuple M=(Q,Σ,δ,q0,F)

Where

Q=Set Of States

Σ=I/p Alphabets

δ=Transition Function(Q×Σ∪{ε}–> 2Q)

q0=Initial State

F= Final State

Q×Σ–> Q–> DFA

Q×Σ–> 2Q–>NFA

Q×Σ∪{ε}–> 2Q–> ε-NFA

 

Example

  1. L={am,bm/m,n≥0}

L={a,b,ε,ab,abb…}

2.L={anbUbna/n≥0}

3.L={(ab)n/n≥0}

4 thoughts on “NFA With ε-Moves Or ε-NFA

Leave a Reply