Theory of Computation (Automata)
The concept in which a finite sequence of symbols drawn from an alphabet is best known as which of these terms?
- A. Epsilon transition
- B. String (formal language) ✓
- C. Universal Turing machine
- D. Moore machine
Correct answer
B. String (formal language)
Explanation
String (formal language) refers to a finite sequence of symbols drawn from an alphabet.