If an FA has N state then it must accept the word of length-04671
If an FA has N state then it must accept the word of length
This multiple choice question (MCQ) is related to the book/course
vu cs402 Theory of Automata.
It can also be found in
vu cs402 Final Term - Quiz No.9.
If an FA has N state then it must accept the word of length
N-1
N+1
N+2N
Must be final state
