Question

Find regular expressions for the languages accepted by the following automata(b and c)

(b) (c)

Answer 1

the regular expression for the b)

the transitions for b)

here i take states are:

s0,s1,s2

s0->final state

s1,s2 are intermediate or kill states

transitions:

s0=a>s1

s0=b>s2

s1=a>s0

s1=b>s0

s2=b>s1

regular expression:

e->episilon or empty string

e+(a+bb)(ab)b+(e+(a+bb)(ab)*b)((a+bb)(ab)*b)(e+(a+bb)(ab)*b)

for c:

regular expression:

(b+(a+e)a*b)(a+(b+ab)(ab)*(a+e+ab)+b+ab)+b+(a+e)a*b

#if you have any doubts comment below..