Back to the 2024 paper
Similar questions
FORMAL 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 THEORYWrite a short note on Multi-stack Turing Machine.20227mFORMAL LANGUAGE & AUTOMATA THEORYWrite short notes on: Multi-tape Turing Machine.20237mFormal Language & Automata TheoryEnumerator is a Turing machine with (i) an output printer (ii) 5 input tapes (iii) a stack (iv) None of the above20212m
PreviousWhich of the following is a type of grammar in the Chomsky hierarchy? (i) Regular (ii) Context-Free (iii) Context-Sensitive (iv) All of the aboveNextWhich of the following problems is undecidable? (i) DFA acceptance (ii) NFA acceptance (iii) The Halting Problem (iv) Regular expression matching