0
Convert the following grammar into finite automata.

Mumbai university > Comp > SEM 4 > TCS

Marks: 5M

Year: Dec 2015

0
0

We can consider states $q_0, q_1,q_2$ corresponding to the states S, X and Y and $q_f$ is new state behaves like final state

The above figure represents the finite automata for the given expression

0