817 views
1 votes
1 votes
Consider the minimal Finite automata that accepts all the strings of a’s & b’s where each string contains
(i) exactly 5 a’s
(ii) atmost 5 a’s
The No. of states in each case respectively are:

2 Answers

0 votes
0 votes
  • Please tell me if im wrong
0 votes
0 votes
case 1 : exactly 5 a's : we will have dfa = 7 states  nfa = 6 states

case 2 : atmost 5 a's : we will have dfa = 7 states nfa = 6 states

for minimal finite automata we will find minimum (dfa,nfa)

which comes out to be 6 states for each case.

Related questions

0 votes
0 votes
0 answers
1
himgta asked Aug 31, 2018
246 views
https://gateoverflow.in/21039/simplified-cfgDoubt in the solution....plz help!
0 votes
0 votes
1 answer
2
himgta asked Aug 7, 2018
349 views
0 votes
0 votes
0 answers
3
himgta asked Jul 31, 2018
397 views
https://gateoverflow.in/188609/me-test-seriesThis question has not been answered, can somebody solve it!
1 votes
1 votes
2 answers
4
himgta asked Jul 31, 2018
2,013 views
Consider the following CFG.S → aSa | bSb | a | b | εFor the above CFG, the total number of strings generated whose length is less than or equal to 8 [exclude the empty...