Theory of Computation (Automata)
Which term refers to a class of languages for which a Turing machine will accept and halt on strings in the language, but may not halt on strings outside it?
- A. Universal Turing machine
- B. String (formal language)
- C. Recursively enumerable language ✓
- D. Pumping lemma
Correct answer
C. Recursively enumerable language
Explanation
Recursively enumerable language refers to a class of languages for which a Turing machine will accept and halt on strings in the language, but may not halt on strings outside it.