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?
Difficulty: Hard
About this MCQ
This Hard Theory of Computation (Automata) MCQ checks one syllabus fact.
The question is: “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?”
The accepted answer is C. Recursively enumerable language. 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.
- A. Universal Turing machine
Why not A: “Universal Turing machine” is not correct. The accepted answer is C. Recursively enumerable language. 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.
- B. String (formal language)
Why not B: “String (formal language)” is not correct. The accepted answer is C. Recursively enumerable language. 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.
- C. Recursively enumerable language ✓
- D. Pumping lemma
Why not D: “Pumping lemma” is not correct. The accepted answer is C. Recursively enumerable language. 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.
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.
Source: Theory of Computation (Automata) Official Reference Guide
Tags: computer science, automata theory, theory of computation, formal languages
Submitted by: MCQsHub Editorial
Related MCQs
- The following statement describes a specific concept. What is it called? a class of formal languages recognize...
- What is the name for the concept where a DFA and an NFA are considered equivalent because they recognize exact...
- What is Epsilon transition primarily used for?
- Which of the following best describes DFA-NFA equivalence?
- Which concept is defined as follows: a transition in a non-deterministic automaton that occurs without consumi...
- Identify the correct concept described as: the process of reducing a deterministic finite automaton to the sma...