Ask
Login
0
1.6kviews
Convert the following grammar into finite automata.
written 7.8 years ago by gravatar for teamques10 teamques10 ★ 64k •   modified 7.8 years ago

Mumbai university > Comp > SEM 4 > TCS

Marks: 5M

Year: Dec 2015
theory of computation
ADD COMMENT EDIT
1 Answer
0
9views
written 7.8 years ago by gravatar for teamques10 teamques10 ★ 64k

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 COMMENT EDIT
Please log in to add an answer.