gs gs101 Introduction to Turing Machines - Non Deterministic Turing Machines - Quiz No.1
gs gs101 Automata Theory Quiz
This quiz belongs to book/course code gs gs101 Automata Theory of gs organization. We have 92 quizzes available related to the book/course Automata Theory. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Introduction to Turing Machines. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.
NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.
Question 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 X?
Name X?
Push Down Automata
Non deterministic Finite Automata
Turing machines
None of the mentioned
Question 2: Which of the following is/are not an application of turing machine?
Language Recognization
Computers of functions on non negative numbers
Generating devices
None of the mentioned
Question 4: Which of the following cannot be a possibility of a TM while it processes an input?
Enters accepting state
Enters non-accepting state
Enters infinite loop and never halts
None of the mentioned
Question 5: Pick the odd one out.
Subroutines
Multiple tracks
Shifting over
Recursion
Question 6: Which among the following is not true for 2-way infinte TM?
tape in both directions
Leftmost square not distinguished
Any computation that can be performed by 2-way infinite tape can also be performed by standard TM.
None of the mentioned
Question 8: Which of the following does not exists?
Mutitape TM
Multihead TM
Multidimentional TM
None of the mentioned
Question 9: Enumerator is a turing machine with __________
an output printer
5 input tapes
a stack
none of the mentioned
Question 10: For the following language, an enumerator will print:
L={anbn|n>=0}
L={anbn|n>=0}
anbn
{ab, a2b2, a3b3, …}
{e, ab, a2b2, a3b3, …}
None of the mentioned
Online Quizzes of gs101 Automata Theory
Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101
Automata Theory Online Quizzes
Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1
gs gs101
Automata Theory Online Quizzes
