Theory of Computation (Automata)
What is the name for a finite automaton where each state has exactly one transition for each possible input symbol?
- A. Turing machine
- B. Deterministic finite automaton (DFA) ✓
- C. Finite automaton
- D. Chomsky hierarchy
Correct answer
B. Deterministic finite automaton (DFA)
Explanation
Deterministic finite automaton (DFA) refers to a finite automaton where each state has exactly one transition for each possible input symbol.