Theory of Computation (Automata)
What is the name for a finite, non-empty set of symbols used to construct strings in a formal language?
- A. Alphabet ✓
- B. Non-deterministic finite automaton (NFA)
- C. Pushdown automaton
- D. Deterministic finite automaton (DFA)
Correct answer
A. Alphabet
Explanation
Alphabet refers to a finite, non-empty set of symbols used to construct strings in a formal language.