Finite Automation FA and Nondeterministic Finite Automation NFA-04660
Finite Automation (FA) and Nondeterministic Finite Automation (NFA) are equivalent if
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.8.
Finite Automation (FA) and Nondeterministic Finite Automation (NFA) are equivalent if
FA and NFA accept the same language
FA shape is same like an NFA
FA accept the null string also
NFA accept the null string also
