Example-03: Construct a NFA for a language which accepts
all the strings in which third symbol
from right end is always ‘a’
SOLUTION:
|
Anything either a or b
|
a
|
Anything either a or b
|
|
Anything either a or b
|
Transition diagram:
Transition table:
|
Present State
|
Next State
|
|
|
Input a
|
Input b
|
|
|
à q0
|
{q0,q1}
|
{q0}
|
|
q1
|
{q2}
|
{q2}
|
|
q2
|
{q3}
|
{q3}
|
|
*q3
|
∅
|
∅
|
Comments
Post a Comment