What is meant by DFA in Theory of Automata and Formal Languages?

Correct Answer: A

a finite automaton with exactly one transition for each state-symbol pair

The correct answer is a finite automaton with exactly one transition for each state-symbol pair.