Example-04: Construct a NFA accepting all the strings ending
with 01 over ∑={0,1}
SOLUTION:
Anything either 0 or 1
|
01
|
Transition diagram:
Transition table:
|
Present State
|
Next State
|
|
|
Input a
|
Input b
|
|
|
à q1
|
{q1,q2}
|
{q1}
|
|
q2
|
{q2}
|
{q3}
|
|
*q3
|
∅
|
∅
|
Comments
Post a Comment