A language is said to be recursively enumerable if it is accepted by a — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2025 paper

Module 4: Turing Machines (TM)

20252m

A language is said to be recursively enumerable if it is accepted by a

(i) DFA
(ii) Turing Machine
(iii) PDA
(iv) Linear Bounded Automaton

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 TheoryRecursively Enumerable languages are also called (i) Turing Recognizable (ii) Turing Decidable (iii) Regular (iv) Context-Free20252m 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 Compiler DesignWhich automaton accepts regular languages? (i) PDA (ii) DFA (iii) Turing machine (iv) LBA20252m

NextRegular languages belong to which type in the Chomsky hierarchy? (i) Type-0 (ii) Type-2 (iii) Type-1 (iv) Type-3