Automata Theory Questions and Answers – Simulation of Turing Machine

This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Simulation of Turing Machine”. 1. Fill in the blank with an appropriate option. In automata theory, ___________ is said to be Computationally Universal if can be used to simulate any single taped Turing Machine. a) Computer’s instruction set b) A programming language … Read more

advertisement

Automata Theory Questions and Answers – Multistack Machines, Counter Machines

This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Multistack Machines, Counter Machines”. 1. Can a single tape turing machine be simulated using deterministic 2-stack turing machine? a) Yes b) No c) Cannot be said d) none of the mentioned 2. A ___________ is a multi tape turing machine whose input … Read more

advertisement

Automata Theory Questions and Answers – Non Deterministic Turing Machines

This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Non Deterministic Turing Machines”. 1. X is a simple mathematical model of a computer. X has unrestricted and unlimited memory. X is a FA with R/W head. X can have an infinite tape divided into cells, each cell holding one symbol. Name … Read more

advertisement

Automata Theory Questions and Answers – Equivalence of One-Tape and Multitape TM’s

This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Equivalence of One-Tape and Multitape TM’s”. 1. Which of the following are related to construction of One Tape turing machines? a) JFLAP b) NFLAP c) All of the mm d) None of the mentioned 2. Which of the following topics cannot be … Read more

advertisement

Automata Theory Questions and Answers – Multitape Turing Machines

This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Multitape Turing Machines”. 1. A turing machine with several tapes in known as: a) Multi-tape turing machine b) Poly-tape turing maching c) Universal turing machine d) All of the mentioned 2. A multitape turing machine is ________ powerful than a single tape … Read more

advertisement

Automata Theory Questions and Answers – Programming Techniques-Storage and Subroutines

This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Programming Techniques-Storage and Subroutines”. 1. A turing machine has ____________ number of states in a CPU. a) finite b) infinte c) May be finite d) None of the mentioned 2. Suppose we have a simple computer with control unit holding a PC … Read more

advertisement

Automata Theory Questions and Answers -Turing Machine and Halting

This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Turing Machine and Halting”. 1. Which of the following regular expression resembles the given diagram? a) {a}*{b}*{a,b} b) {a,b}*{aba} c) {a,b}*{bab} d) {a,b}*{a}*{b}* 2. Construct a turing machine which accepts a string with ‘aba’ as its substring. a) b) c) d) 3. … Read more

advertisement

Automata Theory Questions and Answers – The Language of Turing Machine-2

This set of Automata Theory Questions and Answers for Freshers focuses on ” The Language of Turing Machine-2″. 1. The class of recursively enumerable language is known as: a) Turing Class b) Recursive Languages c) Universal Languages d) RE 2. A language L is said to be Turing decidable if: a) recursive b) TM recognizes … Read more

advertisement

Automata Theory Questions and Answers – The Language of Turing Machine

This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “The Language of Turing Machine”. 1. A turing machine that is able to simulate other turing machines: a) Nested Turing machines b) Universal Turing machine c) Counter machine d) None of the mentioned 2. Which of the problems are unsolvable? a) Halting … Read more

advertisement

Automata Theory Questions and Answers – Turing Machine-Notation and Transition Diagrams

This set of Automata Theory Interview Questions and Answers for freshers focuses on “Turing Machine – Notation and Transition Diagrams”. 1. A turing machine is a a) real machine b) abstract machine c) hypothetical machine d) more than one option is correct 2. A turing machine operates over: a) finite memory tape b) infinite memory … Read more

advertisement
Subscribe to our Newsletters (Subject-wise). Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with latest contests, videos, internships and jobs!

Youtube | Telegram | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & discussions at Telegram SanfoundryClasses.