1 votes 1 votes For the following NFA what will be corresponding DFA I m getting different automata from different methods,by directly convert it into DFA or first convert it into NFA and then DFA. Theory of Computation theory-of-computation + – reena_kandari asked Jun 20, 2017 reena_kandari 6.0k views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Rupendra Choudhary commented Jun 21, 2017 reply Follow Share Both are wrong. Joshi answered it correctly. 0 votes 0 votes reena_kandari commented Jun 22, 2017 reply Follow Share yes,thanks for correcting :) 0 votes 0 votes Nitesh Singh 2 commented Aug 20, 2019 reply Follow Share Firstly convert into NFA, then into DFA. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes THe language for your NFA is (0+1)* Hope you can draw the DFA for this language. Rupendra Choudhary answered Jun 21, 2017 Rupendra Choudhary comment Share Follow See all 0 reply Please log in or register to add a comment.