Back to the 2023 paper
Similar questions
Formal Language & Automata TheoryRecursively Enumerable languages are also called (i) Turing Recognizable (ii) Turing Decidable (iii) Regular (iv) Context-Free20252mFORMAL 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 above20222mFormal 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 above20202mFORMAL LANGUAGE & AUTOMATA THEORYA language L is Turing decidable if: (i) recursive (ii) TM recognizes L (iii) TM accepts L (iv) None of the above20222m
PreviousFrom the options, the pair having different expressive powers is: (i) DPDA and NPDA (ii) DFA and NFA (iii) single-tape TM and multi-tape TM (iv) deterministic single-tape TM and nondeterministic single-tape TMNextIf P and Q are regular expressions (P is not null), then R = Q + RP has the unique solution: (i) R = QP (ii) R = PQ^* (iii) R = QP^* (iv) R = QP^*