Question
In an automata or formal-language problem, which option best represents finite automaton?
Select an option. Your answer will be checked instantly.
Correct Answer: B. a machine model with a finite number of states
Explanation:
In this course context, finite automaton means a machine model with a finite number of states.
Leave a Reply