Theory of Computation (Automata)
Which of the following best describes Deterministic finite automaton (DFA)?
- A. An automaton that uses a stack to recognize context-free languages.
- B. A finite automaton where each state has exactly one transition for each possible input symbol. ✓
- C. A formal grammar in which every production rule has a single non-terminal on its left-hand side.
- D. A visual representation showing how an automaton moves between states based on input symbols.
Correct answer
B. A finite automaton where each state has exactly one transition for each possible input symbol.
Explanation
Deterministic finite automaton (DFA) refers to a finite automaton where each state has exactly one transition for each possible input symbol.