3 votes 3 votes Theory of Computation theory-of-computation finite-automata + – NERU.91 asked Apr 29, 2015 • edited Apr 29, 2015 by NERU.91 NERU.91 8.4k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 9 votes 9 votes NFA for (ab+ba)*Having 3 statesand DFA for samehave 4 states Praveen Saini answered Apr 29, 2015 • selected May 5, 2015 by NERU.91 Praveen Saini comment Share Follow See all 2 Comments See all 2 2 Comments reply abhishek14893 commented Oct 10, 2016 reply Follow Share @sir....>>what is wrong in ... if answer is 1 state if we create a state(initial and final both) and put two loops one of ab and another of ba...thats all 0 votes 0 votes Praveen Saini commented Oct 11, 2016 reply Follow Share We can put one symbol over one transition. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes 4 states. aayushranjan01 answered Apr 29, 2015 aayushranjan01 comment Share Follow See all 2 Comments See all 2 2 Comments reply NERU.91 commented Apr 29, 2015 reply Follow Share how does this accept 'abbaba'? 0 votes 0 votes aayushranjan01 commented Apr 29, 2015 reply Follow Share Sorr, didn't see the kleene closure. ans wud be 3 states.https://gateoverflow.in/?qa=blob&qa_blobid=13214656307930732259 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes 3 states in case of NFA nitishsandhu answered May 2, 2015 nitishsandhu comment Share Follow See all 0 reply Please log in or register to add a comment.
