gs gs101 Introduction to Turing Machines - Multistack and Counter 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: Can a single tape turing machine be simulated using deterministic 2-stack turing machine?
Yes
No
Cannot be said
none of the mentioned
Question 2: A ___________ is a multi tape turing machine whose input tape is read only.
Counter Machine
Multi-stack
Alternating Turing machine
None of the mentioned
Question 3: Instantaneous description of a counter machine can be described using:
the input tape contents
position of the input head
distance of storage heads from symbol Z
all of the mentioned
Question 4: Which of the following parameters cannot be used to restrict a turing machine?
tape alphabets
number of tapes
number of states
none of the mentioned
Question 5: Linear Bounded Automaton is a:
Finite Automaton
Turing Machine
Push down Automaton
None of the mentioned
Question 7: Which of the following is true with reference to semi-infinite tape using a two track tape?
Can simulate a two way tape
Upper track represents the head-right cells
Lower track represents the head-left cells
All of the mentioned
Question 8: Which among the following options are correct?
Statement 1: TMs can accept languages that are not accepted by any PDA with one stack.
Statement 2: But PDA with two stacks can accept any language that a TM can accept.
Statement 1: TMs can accept languages that are not accepted by any PDA with one stack.
Statement 2: But PDA with two stacks can accept any language that a TM can accept.
Statement 1 and 2, both are correct
Statement 1 is correct but Statement 2 is false
Statement 2 is correct while Statement 1 is false
Statement 1 and 2, both are false
Question 9: A two-way infinite tape turing machine is ________ superior than the basic model of the turing machine in terms of power.
more
less
no way
none of the mentioned
Question 10: For a basic turing machine, there exists an equivalent :
2-counter machine
3-counter machine
4-counter machine
All 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
