0 votes 0 votes The minimal finite automata accepting the strings in r=0*1* has ________ states? for DFA its 3 states and for NFA its 2 states which one should i go with? Theory of Computation finite-automata regular-expression + – abhishek1995_cse asked Oct 21, 2018 abhishek1995_cse 522 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply himgta commented Oct 21, 2018 reply Follow Share you have to go for minimum...then obviously NFA for minimal finite automata always go with minimum states in either DFA or NFA 0 votes 0 votes anonymous commented Oct 21, 2018 reply Follow Share Go for NFA. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes If they have specified in question about states in DFA explicitly, then go for DFA. Here minimal finite automata is asked and NFA always has less number of states as compared to DFA. So 2 states. tusharp answered Oct 21, 2018 tusharp comment Share Follow See all 0 reply Please log in or register to add a comment.