Recursively Enumerable languages are also called (i) Turing Recognizab — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2025 paper

Module 4: Turing machines

20252m

Recursively Enumerable languages are also called

(i) Turing Recognizable
(ii) Turing Decidable
(iii) Regular
(iv) Context-Free

Search Google Ask AI

Similar questions

FORMAL LANGUAGE & AUTOMATA THEORYRecursive languages are: (i) a proper superset of CFLs (ii) always recognizable (iii) also called type-0 languages (iv) recognizable by Turing machines20232m 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 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 TheoryPumping Lemma for CFLs is used to prove a language is (i) Not Context-Free (ii) Regular (iii) Decidable (iv) Turing recognizable20252m

PreviousWhich of the following requires context sensitivity? (i) a^n b^n (ii) a^n b^n c^n (iii) (a+b)^* (iv) a^*NextThe Halting Problem is (i) Decidable (ii) Undecidable (iii) Context-Free (iv) Regular