Multiple Choice

Questions(MCQ)
On
Theory of automata(KCS402)
(As per AKTU,Lucknow Syllabus)
(Unit 5)
A Turing machine is a
a) real machine
b) abstract machine
c) hypothetical machine
d) Both (b) and (c)
A Turing machine operates over:
a) finite memory tape
b) infinite memory tape
c) depends on the algorithm
d) none of the mentioned
Turing machine can be represented using the following
tools:
a) Transition graph
b) Transition table
c) Instantaneous Description
d) All of the mentioned
The ability for a system of instructions to simulate a Turing
Machine is called _________
a) Turing Completeness
b) Simulation
c) Turing Halting
d) None of the mentioned
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
Which of the problems are unsolvable?
a) Halting problem
b) Boolean Satisfiability problem
c) Both (a) and (b)
d) None of the mentioned
Which of the following a Turing machine does not consist
of?
a) input tape
b) head
c) state register
d) none of the mentioned
The value of n if turing machine is defined using n-tuples:
a) 6
b) 7
c) 8
d) 5
 Statement: Instantaneous descriptions can be designed for
a Turing machine.
State true or false:
a) true
b) false
Which of the following are the models equivalent to Turing
machine?
a) Multi tape turing machine
b) Multi track turing machine
c) Register machine
d) All of the mentioned
The language recognized by Turing machine is:
(A) Context free language
(B) Context sensitive language
(C) Recursively enumerable language
(D) Regular language
Turing machine consist of:
(A) Input tape
(B) Blank symbol
(C) Tape head
(D) All of these
Turing machine is more powerful than:
(A) Finite automata
(B) Push down automata
(C) Both (a) and (b)
(D) None of these
Alan Turing introduced Turing machine in
(A) 1936
(B) 1938
(C) 1940
(D) 1935
In definition of TM T= (Q, Σ,Γ, q0, δ) what Γ represents?
(A) Tape alphabets
(B) Input symbols
(C) Transition function
(D) Initial state
A language L is said to be Turing decidable if:
a) recursive
b) TM recognizes L
c) TM accepts L
d) Both (a) and (b)
 Which of the following statements are false?
a) Every recursive language is recursively enumerable
b) Recursively enumerable language may not be recursive
c)Recursive languages may not be recursively
enumerable
d) None of the mentioned
 In one move, the Turing machine:
(A) May change its state
(B) May write a symbol on the cell being scanned.
(C) May move the head one position left or right
(D) All of the above
 Halting state of Turing machine are:
(A) Start and stop
(B) Accept and reject
(C) Start and reject
(D) Reject and allow
 Which of the following is the restricted model of turing
machines
a) Turing machine with semi-infinite tape
b) Multi stack machine
c) Offline turing machine
d) Both (a) and (b)
Choose the correct option:
Statement: If L1 and L2 are recursively enumerable
languages over S, then the following is/are recursively
enumerable.
a) L1 U L2
b) L2 ∩ L2
c) Both (a) and (b)
d) None of the mentioned
 Which of the following is an extension to the basic model
of Turing machine:
(A) Multi tape Turing machine
(B) Multi head Turing machine
(C) Nondeterministic Turing machine
(D) All of the above
 Why Turing machine is more powerful than Finite
automata?
(A) Turing machine head movement is continued to one
direction.
(B) Turing machine head moment is in both directions
(C) Turing machine has capability to remember
arbitrary long sequence of input string.
(D) All are correct
 Choose the appropriate option:
Statement: If a language L is recursive, it is closed under the
following operations:
a) Union
b) Intersection
c) Complement
d) All of the mentioned
 A recursively enumerable language L can be recursive if:
a) L’ is recursively enumerable
b) Every possible sequence of moves of T, the TM which
accept L, causes it to halt
c) Both (a) and (b)
d) None of the mentioned
 If T1 and T2 are two turing machines. The composite can
be represented using the expression:
a) T1T2
b) T1 U T2
c) T1 X T2
d) None of the mentioned
 Universal Turing machine (UTM) influenced the concepts
of
(A) Computability
(B) Interpretive implementation of programming language
(C) Program and data is in same memory
(D) All are correct
 A universal Turing machine is a
(A) Single tape Turing machine
(B) Two-tape Turing machine
(C) Reprogrammable Turing machine
(D) None of them
 A multitape turing machine is ________ powerful than a
single tape turing machine.
(A)more
(B)less
(C)equal
(D) none of the mentioned
 State true or false:
Statement: Multitape turing machine have multi tapes where
each tape is accessed with one head.
a) true
b) false
 Which of the following does not exists?
a) Turing Machine with Multiple heads
b) Turing Machine with infinite tapes
c) Turing machine with two dimensional tapes
d) None of the mentioned
PCP stands for?
a) Post Correspondence Problem
b) Post Corresponding Problem
c) Pre Correspondence problem
d) None of the mentioned
 Which of the following statements are undecidable?
For a given Turing Machine M,
a) does M halt on an empty input tape
b) does M halt for anly inputs at all?
c) is L(M) regular? Context free? Turing decidable?
d) all of the mentioned
 State true or false:
Statement: The difference between PCP and MPCP is that in
MPCP, a solution is required to start with the first string on
each list.
a) true
b) false
Post Correspondence problem is
a) decidable decision problem
b) undecidable decision problem
c) not a decision problem
d) none of the mentioned
 Can a Modified PCP problem be reduced to PCP?
a) yes
b) no
 A language L is said to be ____________ if there is a
turing machine M such that L(M)=L and M halts at every
point.
a) Turing acceptable
b) decidable
c) undecidable
d) none of the mentioned
 The language accepted by a turing machine is called
____________
a) Recursive Enumerable
b) Recursive
c) Both (a) and (b)
d) None of the mentioned
A formal language is recursive if :
a) a total Turing machine exists
b) a Turing machine that halts for every input
c) Turing machine rejects if the input does not belong to the
language
d) all of the mentioned
 Recursive languages are also known as:
a) decidable
b) undecidable
c) sometimes decidable
d) none of the mentioned
 The class of recursive language is known as:
a) R
b) RC
c) RL
d) All of the mentioned
 The complexity class P consist of all the decision problems
that can be solved by ___________using polynomial
amount of computation time.
a. Push Down automata
b. DFA
c. NDFA
d. Deterministic Turing machine
When problem is said to be un-decidable?
A) There exists an algorithm to find answer of the problem is yes or
no.
B) There is no algorithm to find answer of the problem is yes or
no.
C) There is no algorithm to find answer of the problem is yes.
D) There is an algorithm to find answer of the problem is yes
 When problem is said to be decidable?
A) There exists an algorithm to find answer of the problem
is yes or no.
B) There is no algorithm to find answer of the problem is yes
or no.
C) There is no algorithm to find answer of the problem is yes
D) There is an algorithm to find answer of the problem is yes
 What are recursive enumerable languages?
A) There exists a PDA to accept the languages.
B) There exists a Turing Machine to accept the languages.
C) There exists a Finite Automata to accept the languages.
D) None of the mentioned
 Which is false about recursive languages?
A) The language is recursive then it is decidable.
B) The language is not recursive then it is undecidable
C) There exists a Turing Machine to accept the languages.
D) The complement of recursive language is neither
recursive nor non recursive
 MPCP stands for
A) Many Posts Correspondence Problem
B) Many Posts Correspondence Problem
C) Modified Posts Correspondence Problem
D) Merged Posts Correspondence Problem
 A language L is said to be ____________ if there is a Turing
machine M such that L(M)=L and M halts at every point.
A) Turing acceptable
B) Decidable
C) Undecidable
D) None of the mentioned
The complement of recursive language is
A) recursive
B) neither recursive nor non recursive
C) non recursive
D) recursive or non recursive
 Recursively enumerable language are closed under
A) Concatenation
B) Intersection
C) Union
D) All of these
The class of unrestricted language corresponds to
A) PDA
B) TM
C) LBA
D) FA
‟MPCP is undecidable problem ‟ is ----------- ?
A) True
B) False
Which of the following is superset to all ?
A) Type 3 –regular grammar
B) Type 2 –context free grammar
C) Type 1 – context sensitive grammar
D) Type 0 –unrestricted grammar
Which of the following problems is undecidable?
A) Membership problem for CFGs
B) Ambiguity problem for CFGs
C) Finiteness problem for FSAs
D) Equivalence problem for FSAs
 Which of the following problems is undecidable?
A) Deciding if a given context-free grammar is
ambiguous
B) Deciding if a given string is generated by a given
context-free grammar
C) Deciding if the language generated by a given context-
free grammar is empty
D) Deciding if the language generated by a given context-
free grammar is finite
Consider the following statements:
1. The complement of every Turning decidable language is
Turning decidable
2. There exists some language which is in NP but is not
Turing decidable
3. If L is a language in NP, L is Turing decidable
Which of the above statements is/are True?
A) Only 2
B) Only 3
C) Only 1 and 2
D) Only 1 and 3
Consider the following types of languages:
L1 Regular,
L2: Context-free,
L3: Recursive,
L4: Recursively enumerable.
Which of the following is/are TRUE?
I. L3' U L4 is recursively enumerable
II. L2 U L3 is recursive
III. L1* U L2 is context-free
IV. L1 U L2' is context-free
A) I only
B) I and III only
C) I and IV only
D) I, II and III only
Which among the following are undecidable theories?
A) The first order theory of Boolean algebra
B) The first order theory of Euclidean geometry
C) The first order theory of hyperbolic geometry
D) The first order theory of the natural number with
addition, multiplication, and equality