Multistack Machines, Counter Machines MCQ

Test your knowledge with important Multistack Machines, Counter Machines MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Multistack Machines, Counter Machines MCQs at Bissoy

• For a basic turing machine, there exists an equivalent :
  ক

  2-counter machine

  খ

  3-counter machine

  গ

  4-counter machine

  ঘ

  All of the mentioned
• 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
• 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 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
• 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
• State true or false: Statement: Using a two track tape, we can use a semi infinite tape to simulate an infinte tape.
  ক

  true

  খ

  false
• Linear Bounded Automaton is a:
  ক

  Finite Automaton

  খ

  Turing Machine

  গ

  Push down Automaton

  ঘ

  None of the mentioned
• 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
• 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
• A ___________ is a multi tape turing machine whose input tape is read only.
  ক

  Counter Machine

  খ

  Multi-stack

  গ

  Alternating Turing machine

  ঘ

  None of the mentioned
• Can a single tape turing machine be simulated using deterministic 2-stack turing machine?
  ক

  Yes

  খ

  No

  গ

  Cannot be said

  ঘ

  none of the mentioned