1 1 vote Theory of Computation + – Samujjal Das 1.1k views answer comment Share Follow Print See all 3 Comments 3 3 Comments reply papesh commented Nov 13, 2016 reply Follow flag L1 = epsilon, ab,abab.... L2 =epsilon,ab,aabb,aaabbb..... So=epsilon,ab DFA=4 states NFA=3 states 3 3 replyShare Habibkhan commented Nov 14, 2016 reply Follow flag Plz change ur comment to answer.. 2 2 replyShare Wanted commented Jan 23, 2017 reply Follow flag https://gateoverflow.in/109430/ace-toc-1 0 0 replyShare Please log in or register to add a comment.
Best answer 2 2 votes L1 = epsilon, ab,abab.... L2 =epsilon,ab,aabb,aaabbb..... So L={epsilon,ab} DFA=4 states NFA=3 states papesh answered Nov 14, 2016 • selected Nov 14, 2016 by Habibkhan papesh comment Share Follow See all 4 Comments 4 4 Comments reply Samujjal Das commented Nov 14, 2016 reply Follow flag Should we take 3 or 4? 0 0 replyShare Prashant. commented Nov 14, 2016 reply Follow flag 3 wil be answer Talk about FA and DFA. 1 1 replyShare Samujjal Das commented Nov 14, 2016 reply Follow flag So whenever they mention minimal FA, we should consider NFA right? 0 0 replyShare Prashant. commented Nov 14, 2016 reply Follow flag you should consider both dfa and Nfa but take which ever minimum. 0 0 replyShare Please log in or register to add a comment.