Question

(10pt] Use the procedure described in Lemma 1.60 of the textbook to convert the following DFA into regular expression: Note: Follow the procedure used in examples 1.66 and 1.68 of the textbook. Draw all the steps in your printout answer. Remark: Even though submitting 5 rejected and 5 accepted strings is not required, it is highly recommended. Think of the process as unit testing of your design

Answer 1

. a • - la Cathy ako berb (a+b) a*b .: The Re is : € + (a+h) a*b (ba*b)*+(a+b) a*b(ba*b). Since the initial state is final state, E is accepted by the finite automata Also we have two final state, therefore two different expression for both.

If you have any doubt, comment down and get it cleared..

Also please upvote thanks...