Question: Convert the following grammar into finite automata.
0

Mumbai university > Comp > SEM 4 > TCS

Marks: 5M

Year: Dec 2015

ADD COMMENTlink
modified 3.3 years ago  • written 3.3 years ago by gravatar for Pooja Joshi Pooja Joshi740
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

enter image description here

The above figure represents the finite automata for the given expression

ADD COMMENTlink
written 3.3 years ago by gravatar for Pooja Joshi Pooja Joshi740
Please log in to add an answer.