Theory of Computation (Automata)
Which term refers to a property of a problem indicating whether an algorithm can be constructed that always provides a correct yes/no answer?
- A. Alphabet
- B. Deterministic finite automaton (DFA)
- C. Pushdown automaton
- D. Decidability ✓
Correct answer
D. Decidability
Explanation
Decidability refers to a property of a problem indicating whether an algorithm can be constructed that always provides a correct yes/no answer.