A recursively enumerable language L is recursive if: (i) L' is recursi — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2022 paper

Module 5: Undecidability

20222m

A recursively enumerable language $L$ is recursive if:

(i) $L'$ is recursively enumerable
(ii) every sequence of moves of $T$ halts
(iii) Both (i) and (ii)
(iv) None of the above

Search Google Ask AI

Similar questions

Formal Language & Automata TheoryA language L may not be accepted by a turing machine if (i) it is recursively enumerable (ii) it is recursive (iii) L can be enumerated by some turing machine (iv) None of the above20202m FORMAL LANGUAGE & AUTOMATA THEORYA language L is Turing decidable if: (i) recursive (ii) TM recognizes L (iii) TM accepts L (iv) None of the above20222m FORMAL LANGUAGE & AUTOMATA THEORYA language is said to be recursively enumerable if it is accepted by a (i) DFA (ii) Turing Machine (iii) PDA (iv) Linear Bounded Automaton20252m Formal Language & Automata TheoryRecursively Enumerable languages are also called (i) Turing Recognizable (ii) Turing Decidable (iii) Regular (iv) Context-Free20252m

PreviousA Turing machine that is able to simulate other Turing machines is called: (i) nested Turing machine (ii) universal Turing machine (iii) counter machine (iv) None of the above NextRASP stands for: (i) Random Access Storage Program (ii) Random Access Stored Program (iii) Randomly Accessed Stored Program (iv) Random Access Storage Programming