Register

number of states of minimal nfa accepting strings of length n
closed

• closed by
2,531 views

1 Answer

1 votes
1 votes
Minimal states for Nfa for n length string is n+1 .
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
KingSAJ asked Jan 19, 2015
818 views
The number of states in a DFA accepting all the strings over {0,1} in which 5th symbol from right hand side is always '1' is?
Will the answer be $4$ or $2^5$?
User Avatar
3 votes
3 votes
1 answer
2
rahul sharma 5 asked Aug 4, 2017
1,315 views
Number of Final states in minimal FA(NFA)
What will be total number of final states in NFA for the given regular expression? $R=(a+b)^{*}b(a+b+\epsilon )$
What will be total number of final states in NFA for the given regular expression?$R=(a+b)^{*}b(a+b+\epsilon )$
User Avatar
14 votes
14 votes
5 answers
3
Vikrant Singh asked Feb 1, 2015
4,354 views
No. of states in the minimal finite automata which accepts the binary strings whose equivalent is divisible by 32 is ________?
No. of states in the minimal finite automata which accepts the binary strings whose equivalent is divisible by 32 is ________?A. 5B. 6C 31D 32
User Avatar
Link Copied!