Question
In an automata or formal-language problem, which option best represents DFA?
Correct Answer: C
a finite automaton with exactly one transition for each state-symbol pair
In this course context, DFA means a finite automaton with exactly one transition for each state-symbol pair.
In this course context, DFA means a finite automaton with exactly one transition for each state-symbol pair.
Leave a Reply