$(i)6 \text{states} (ii) \text{7 states}$

The Gateway to Computer Science Excellence

+1 vote

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:

(i) exactly 5 a’s

(ii) atmost 5 a’s

The No. of states in each case respectively are:

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.

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.

0

Finite Automata means it is DFA but not NFA

PDA means it is NPDA but not DPDA (i know every DPDA is NPDA)

Turing Machine means it is DTM by Default

PDA means it is NPDA but not DPDA (i know every DPDA is NPDA)

Turing Machine means it is DTM by Default

0

but nfa and dfa has the same power and i have read it somewhere that when they ask for minimal finite automata we find the minimum between nfa and dfa.

0

Note that compare to DFA, NFA always have Less no.of states, therefore it leads to the statement F**A means NFA**

**As per my knowledge those are correct.**

Every DFA is NFA but Every NFA is not DFA, even though power of them is equal

therefore if F**A means NFA **then it always forgetting DFA

0

This question is asking about minimal finite automata ,then we should draw nfa or minimal state DFA ,Somebody please confirm [email protected]Shaik Masthan

52,217 questions

59,907 answers

201,102 comments

118,146 users