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

A. a finite automaton with exactly one transition for each state-symbol pair B. an automaton that may choose many transitions for the same input C. a pushdown automaton without a stack alphabet D. a grammar with ambiguous derivations only