0

1.7kviews

Convert the following grammar into finite automata.

written 8.5 years ago by teamques10 ★ 69k

•   modified 8.5 years ago

Mumbai university > Comp > SEM 4 > TCS

Marks: 5M

Year: Dec 2015

theory of computation

ADD COMMENT FOLLOW SHARE EDIT

1 Answer

0

9views

written 8.5 years ago by teamques10 ★ 69k

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

ADD COMMENT SHARE EDIT