Question
In an automata or formal-language problem, which option best represents NFA?
Correct Answer: B
a finite automaton that may allow multiple possible moves for the same input
In this course context, NFA means a finite automaton that may allow multiple possible moves for the same input.
In this course context, NFA means a finite automaton that may allow multiple possible moves for the same input.
Leave a Reply