405 views

2 Answers

Best answer
4 votes
4 votes

In the given FA , both the final states are equivalent ..So we can remove one of them 

and can write the regular expression as :  a*b ( ϵ + a.a* ) ..

Now we know for a regular expression r , we can write :  ϵ + r . r*  = r* 

So here the regular expression is simplified as : a* b a*

selected by
2 votes
2 votes

$If \:R=Q+RP \:then \:R=QP^*\\ q_{1} = q_1a + \epsilon \\ q_{2} = q_1b+q_3a\\ q_3=q_1b+q_2a \\ q_1 = a^{*} \\ Now \: q_2 = a^*b+q_3a \\ Subtitute\: q_2 \:in \:q_3 \\ q_3=a^*b+(a^*b+q_3a)a \\ q_3=a^*b+a^*ba+q_3aa \\ q_3 =(a^*b+a^*ba)(aa)^*$

Related questions

2 votes
2 votes
1 answer
4
Ayush Upadhyaya asked Mar 10, 2017
1,277 views
Give a regular expression for the language over {0,1}NOT CONTAINING 101 AS SUBSTRING.