Theory of Computation (Automata)
What does Recursively enumerable language refer to?
Difficulty: Hard
About this MCQ
This Hard Theory of Computation (Automata) MCQ checks one syllabus fact.
The question is: “What does Recursively enumerable language refer to?”
The accepted answer is B. 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.. 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. The sequence of production rule applications used to generate a string from a grammar's start symbol.
Why not A: “The sequence of production rule applications used to generate a string from a grammar's start symbol.” is not correct. The accepted answer is B. 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.. 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. 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. A finite sequence of symbols drawn from an alphabet.
Why not C: “A finite sequence of symbols drawn from an alphabet.” is not correct. The accepted answer is B. 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.. 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.
- D. A finite-state machine whose output values are determined solely by its current state.
Why not D: “A finite-state machine whose output values are determined solely by its current state.” is not correct. The accepted answer is B. 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.. 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
B. 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.
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
- Select the accurate description of Context-sensitive language.
- Which of the following best describes DFA-NFA equivalence?
- The following statement describes a specific concept. What is it called? a class of formal languages recognize...
- Identify the correct concept described as: the process of reducing a deterministic finite automaton to the sma...
- What is Epsilon transition primarily used for?
- DFA minimization is best defined as which of the following?