534 views
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?

1 Answer

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.

Related questions

0 votes
0 votes
0 answers
1
paressep28 asked 5 days ago
50 views
How is "All strings {0,1} of length five or more in which the third symbol from the right end is different from the leftmost symbol" solved? Answer Follow·1 Request ...