1 votes 1 votes Construct a DFA that accepts the language represented by: r = (ab/ba)* aa (ab/ba)* Shubham Tripathi asked Sep 29, 2016 Shubham Tripathi 3.3k views answer comment Share Follow See 1 comment See all 1 1 comment reply Shubham Tripathi commented Sep 29, 2016 reply Follow Share THANK YOU! 0 votes 0 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes DFA: assuming by "/" you mean "+". if its right quotient operation, the regular expression reduces to "aa" Anusha Motamarri answered Sep 29, 2016 selected Sep 29, 2016 by vijaycs Anusha Motamarri comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments vijaycs commented Sep 29, 2016 reply Follow Share @Motamarri Anusha , please check again, I see it is accepting. q0------( a) -----> q1-------(a) ------->q2------(b)---->q1------(b)------->q0----(a)----->q1-----(a)-----q2 ( Accept). 0 votes 0 votes Anusha Motamarri commented Sep 29, 2016 reply Follow Share plz check now :) 0 votes 0 votes vijaycs commented Sep 29, 2016 reply Follow Share hmm, now seems correct. : ) 0 votes 0 votes Please log in or register to add a comment.