In an automata or formal-language problem, which option best represents DFA?

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