Back to the 2021 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 THEORYA Turing Machine has: (i) A finite tape (ii) An infinite tape (iii) A stack (iv) A queue20242mFORMAL LANGUAGE & AUTOMATA THEORYA Turing Machine that prints strings of a language is called (i) Acceptor (ii) Transducer (iii) Generator (iv) Enumerator20252mFORMAL LANGUAGE & AUTOMATA THEORYWrite short notes on: Multi-tape Turing Machine.20237m
PreviousWhich of the following statements is/are False? A. For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine. B. Turing recognizable languages are closed under union and complementation. C. Turing decidable languages are closed under intersection and complementation. D. Turing recognizable languages are closed under union and intersection. (i) A and D only (ii) A and C only (iii) B only (iv) C onlyNextThe language \{a^mb^nc^{m+n} \mid m, n \ge 1\} is (i) regular (ii) context-free but not regular (iii) context-sensitive but not context-free (iv) type-0 but not context-sensitive
Budget AppAndroid App
Pocketly on Android
Log daily food, travel, and hostel expenses instantly. Set monthly spending limits and see where your money goes without complex spreadsheets.