If an FA accept a word then there must exist a path from-04734
If an FA accept a word then there must exist a path from
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.16.
If an FA accept a word then there must exist a path from
Initial to final state
Initial to each state
Initial to each state but not to final state
Initial to final state by traversing each state
