1 1 vote Consider the following language. L = {wxwy | x,y,w∈(a+b)+} How many states are there in equivalent NFA for above L? Theory of Computation + – User007 887 views answer comment Share Follow Print See 1 comment 1 1 comment reply ManojK commented Oct 2, 2016 reply Follow flag I think 7. R.E.=$a(a+b)^{+}a(a+b)^{+}+b(a+b)^{+}b(a+b)^{+}$ 1 1 replyShare Please log in or register to add a comment.
Best answer 6 6 votes RE for this language will be => a(a + b)+a(a + b)+ + b(a + b)+b(a + b)+ NFA will be : -- Kapil answered Oct 2, 2016 • selected Oct 2, 2016 by ManojK Kapil comment Share Follow See all 4 Comments 4 4 Comments reply Sushant Gokhale commented Oct 16, 2016 i edited by Sushant Gokhale Oct 17, 2016 reply Follow flag @Kapil. this question is ambigous. Its asking for NFA and not min NFA/DFA. I can have any NFA. 0 0 replyShare Rajesh Raj commented Oct 16, 2016 reply Follow flag where u guys use to draw the images ??on which software? 0 0 replyShare vijaycs commented Oct 16, 2016 reply Follow flag @Rajesh Raj http://madebyevan.com/fsm/ 0 0 replyShare Rajesh Raj commented Oct 16, 2016 reply Follow flag thnku vijacs 0 0 replyShare Please log in or register to add a comment.
