A language L may not be accepted by a turing machine if (i) it is recu — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2020 paper

Module 4: Turing machines

20202m

A 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 above

Search Google Ask AI

Similar questions

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 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 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

PreviousThe decision problem is the function from string to _____. (i) char (ii) int (iii) boolean (iv) None of the above NextWrite the context-free grammar to create palindrome over \{a, b\}.