Theory Of Computation

Question

What is the regular expression for this E-NFA:-

Answer 1

Here is the answer 
(a+b)(aa)^*

Comments

i got     b(aa)*

bro how did u get (a+b) i think there would be no chance of getting that bcz from q1  by taking only "b" it moves to q2 but not by taking    a,b

thats my solution .thank u

Answer 2

i got     b(aa)*

bro how did u get (a+b) i think there would be no chance of getting that bcz from q1  by taking only "b" it moves to q2 but not by taking    a,b

thats my solution .thank u

Comments

(a+b)(aa)* = a(aa)* +  b(aa)* 

@suryaprakash   your RE is wrong  , it cAnnot  generate   Single {a} which should be accepted , by taking null move from (1)  you can reach to state 4 and then from 4--->2  , so single a going to be accept 

{ 

---

that means can we write directly   a,b from 1 to 2

without  any  e-move.. can we write like that

---

@suryaprakash  mtlb ? likhke bata bhai ?? kya khna chara