The Gateway to Computer Science Excellence
+1 vote
1.3k views
closed with the note: got the correct answer
in Theory of Computation by (155 points)
closed by | 1.3k views

1 Answer

+1 vote
Minimal states for Nfa for n length string is n+1 .
by Boss (10.5k points)
0
should it be n+2 , as one more states is needed for dead state if the input length is greater than n
0
^^ NFA is asked in question , no dead state required
0
the question is asked for nfa as  no dead state is present in nfa, so minimal no of states for a n length string in nfa will be n+1
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,324 answers
198,405 comments
105,169 users