Theory of Computation (Automata)
Which of the following best describes Alphabet?
- A. A property of a problem indicating whether an algorithm can be constructed that always provides a correct yes/no answer.
- B. A finite, non-empty set of symbols used to construct strings in a formal language. ✓
- C. The undecidable problem of determining whether a given program will finish running or continue forever.
- D. An abstract computational model that manipulates symbols on an infinite tape according to a set of rules.
Correct answer
B. A finite, non-empty set of symbols used to construct strings in a formal language.
Explanation
Alphabet refers to a finite, non-empty set of symbols used to construct strings in a formal language.