a. Draw a state diagram and construct a regular expression corresponding to the following state transaction table

5.6kviews

written 7.7 years ago by

teamques10 ★ 67k

• modified 2.8 years ago

Mumbai University > Computer Engineering > Sem 4 > Theoretical Computer Science

Marks: 10M

Year: Dec 2016

theory of computation

ADD COMMENT EDIT

1 Answer

386views

written 7.7 years ago by

teamques10 ★ 67k

enter image description here

Solution:

a. State Diagram

enter image description here

b. Regular expression

q1=q10+q21

q2=q21+q30

q3=q10+q21

Now,

q1=q10+1(q21+q30)

q1=q10+1(q21+0(q10+q21))

q1=q10+q211+q1001+q2011

q1=(q211+q201)+q1(0+001)

R=Q+RP

By Arden theorem,

q1=(0+001)*

q2=(0+001)*0=r1

q3=(0+001)*1=r2

r=r1+r2

ADD COMMENT EDIT

Please log in to add an answer.