Back to the 2025 paper
Similar questions
Formal Language & Automata TheoryEnumerator is a Turing machine with (i) an output printer (ii) 5 input tapes (iii) a stack (iv) None of the above20212mFORMAL LANGUAGE & AUTOMATA THEORYEnumerator in a Turing machine is a TM with: (i) an output printer (ii) 5 input tapes (iii) a stack (iv) None of the above20212mFORMAL LANGUAGE & AUTOMATA THEORYDesign a Turing Machine that enumerates all strings over {a, b} in lexicographic order. Explain the working of the machine.20257mFormal Language & Automata TheoryRecursively Enumerable languages are also called (i) Turing Recognizable (ii) Turing Decidable (iii) Regular (iv) Context-Free20252m
PreviousWhich production is not allowed in a CSG? (i) AB \rightarrow BA (ii) A \rightarrow \epsilon (iii) A \rightarrow a (iv) a B \rightarrow a bNextIf \Sigma = \{a, b\}, then \Sigma^* contains (i) Only finite strings (ii) Only infinite strings (iii) All finite strings over \Sigma including \epsilon (iv) Only strings of equal length