1 votes 1 votes What is the regular expression for this E-NFA:- Theory of Computation theory-of-computation finite-automata regular-expression + – Sahil1994 asked Aug 29, 2017 Sahil1994 548 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 3 votes 3 votes Here is the answer (a+b)(aa)* aehkn answered Aug 29, 2017 • selected Aug 29, 2017 by Sahil1994 aehkn comment Share Follow See 1 comment See all 1 1 comment reply suryaprakash commented Jan 14, 2018 reply Follow Share 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 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes 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 suryaprakash answered Jan 14, 2018 suryaprakash comment Share Follow See all 3 Comments See all 3 3 Comments reply sumit goyal 1 commented Jan 14, 2018 reply Follow Share (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 { 0 votes 0 votes suryaprakash commented Jan 14, 2018 reply Follow Share that means can we write directly a,b from 1 to 2 without any e-move.. can we write like that 0 votes 0 votes sumit goyal 1 commented Jan 14, 2018 reply Follow Share @suryaprakash mtlb ? likhke bata bhai ?? kya khna chara 0 votes 0 votes Please log in or register to add a comment.