949 views

1 Answer

2 votes
2 votes
only one state in both the cases NFA OR DFA . and by the way it is asking about minimal FA (NFA) so ans should be 1 only .

ref : http://www.cs.odu.edu/~toida/nerzic/390teched/regular/fa/acceptor.html

Related questions

1 votes
1 votes
1 answer
1
sumit goyal 1 asked Jan 9, 2018
790 views
I can use 4 state dfa for no. of a should be divisible by 4 then minimum = 4 , or we have to construct dfa with 8 states ??
1 votes
1 votes
1 answer
2
Prajwal Bhat asked Jan 17, 2017
1,359 views
No. of states in the DFA accepting the following set of strings are:( ( aa* + φ* )* (aa* + φ* ) + bb* + φ* φ + φ* )*Quite confusing to me. Share your approach!
2 votes
2 votes
2 answers
3
worst_engineer asked Jan 14, 2016
563 views
Which of the following represent the minimum no. of states in DFA which accept all string of length atmost 5 ‘a’?6457Answer given in 5 , how possible ?atmost ...
0 votes
0 votes
1 answer
4
resuscitate asked Dec 13, 2015
2,863 views
I solved both of these qs in a traditional way,by drawing nfa and then convert them to dfa..by tthis process ans shoulbe 4 and 2..but both of them are wrong..pls check..