Convert the following grammar into finite automata.

Mumbai university > Comp > SEM 4 > TCS

Marks: 5M

Year: Dec 2015


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

enter image description here

The above figure represents the finite automata for the given expression

Please log in to add an answer.

Continue reading

Find answer to specific questions by searching them here. It's the best way to discover useful content.

Find more