Question

Consider the finite automaton M = (Q,{a, b},8,90,F) defined by the following illustration. -0.00 7 92 Part (a) (8 MARKS] For

0 0
Add a comment Improve this question Transcribed image text
Answer #1

From starting state q0 , the last state will be q0 only if there is repeated sequence of ab so that on input a, transition from q0 to q1 will happen and from input b, transition from q1 to q0 will happen.

Hence, regular expression R0 for the given DFA such that last state should be q0 is given by R0 = (ab)* which means any possible repetition of sequence ab. Hence L(R) = {(ab)* )

State q1 is reached, only when previous state was q0 and input a is supplied. Hence regular expression for R1 can be obtained from regular expression for R0 by inserting a at the end. Hence regular expression for R1 = (ab)*a i.e. L(R1) = {(ab)*a)

State q2 is reached either when input b is given to state q0 or input b is given to state q3 . State q3 is reached when either input a is given to q1 or input a is given to q2 .

Regular expression for q2 is R2 = (ab)*b + (ab)*aa(ba)*b .  

Here, (ab)*b is the path to reach q2 from q0 and (ab)*aa(ba)*b is the path to reach q2 from q0 to q1 then from q1 to q3 and then q3 to q2 .

Regular expression for q3 is R3 = b(ab)*a + (ab)*aa(ba)*

Please comment for any clarification.

Add a comment
Know the answer?
Add Answer to:
Consider the finite automaton M = (Q,{a, b},8,90,F) defined by the following illustration. -0.00 7 92...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT