Q.

Multiple Choice Questions

No
1 In PDA , in the stack ,elements can be added
a
a) on the top b)from bottom c)in the middle d) anywhere
)
The stack in PDA has
b
a)unlimited memory b)read only
)
c)limited memory d) has no memory
Which of the following are true
a) The membership problem of CFL is undecidable
c
b) It is undecidable if CFL is regular
)
c) The halting problem of Finite automata is undecidable
d) The membership problem for type languages is decidable
If PCP is decidable then MPCP is
d
a) Decidable b) undecidable c) cannot say d) none
)
Which of the following is false with respect to possible outcomes of executing a turing
machine
e
a) halt and accept b)halt,change input c)halt reject d)
)
never halt

If PDA does not stop on an accepting state and the stack is not empty ,the string
f)
is_________________.
A decision problem that can be solved by an algorithm is said to be
g
) _______________.
h A DPDA is a PDA in which no state P has ________________ outgoing transitions.
)
i) ___________ method is used to prove the undecidability of halting problem.
_________ theorem says that all non-trivial properties about the language of a TM are
j)
undecidable.

Q. Questions
No
(a)Illustrate the components of Pushdown Automata
(b) Construct a PDA from the following CFG. G = ({S, X}, {a, b}, P, S) where the
2
S → XS | ∈ , A → aXb | Ab | ab.
productions are given below.

(a) Construct a PDA that accepts L= {0n1n 0n |n>=0}.

3
(b) Analyze the acceptability of Pushdown Automata
(a)Illustrate the closure properties and decision properties of context free languages.
(b)Consider the CFG with {S,A,B) as the non-terminal alphabet, {a,b, ε) as the
4
ASA | aB | b ; A → B ; B → b | ∈. Convert the given grammar into CNF.
terminal alphabet, S as the start symbol and the following set of production rules S →

(a) Construct a Turing machine for subtracting two unary numbers.

5
(b)List out restricted turing machines. Discuss in detail.
6 (a) Illustrate P and NP problems with suitable examples.
 (b) Convert the grammar into GNF
S->AB
A->BS/b
B-> SA/a
(a) Illustrate undecidable problems with suitable examples.
7 (b) Define PCP. Find whether the lists M=(abb, aa, aaa) and N=(bba, aaa, aa) have a
Post Correspondence Solution?

Q. No Multiple Choice Questions

1 a Illustrate the components of Pushdown Automata
)
b Elaborate Diagnolization Language Ld
)
c Illustrate the properties of recursive language and recursively enumerable language
)
d Justify the acceptance of PDA
)
e Illustrate Sentential forms
)
f) Illustrate the normal forms of Context Free Grammar
g Elaborate decidability with an examples
)
h Differentiate NP and P problems
)
i) Illustrate Post Correspondence Problem
j) Elaborate Universal Turing Machine

Q. Questions
No
a) Construct a PDA from the following CFG. G = ({S, X}, {a, b}, P, S) where the

S → XS | ∈ , A → aXb | Ab | ab
productions are given below.

b) Convert the following PDA to CFG

M=({q0,q1},{a,b},{z0,z1}, δ,q0,z0,Φ) where ‘δ’ is given by
2
δ (q0,a,z0)=(q0,z1z0)
δ (q0,a, z1)=(q0, z1z1)
δ (q0,b, z1)=(q1,ε)
δ (q1,b, z1)=(q1, ε)
δ (q1,ε, z0)=(q1,ε)
a) Construct PDA for L={anbmcmdn | n>=1, m>=1} with acceptance of final states.
b) Convert the following CFG to CNF
3 S->AaB| aaB
A->ε
B->bba
4 a) Construct the PDA for the following CFG
 S->0BB
B->0S|1S|0, Test whether 0104 is acceptable by this PDA.
b) Convert the grammar,
S->AB
A->BS|b
B->SA|a into Greibach Normal Form
a) Construct a Turing Machine for 2’s complement
5
b) Construct a Turing Machine for reversal of string
a) Construct a Turing Machine for performing multiplication of two unary numbers
6
b) Enumerate different types of Turing Machine
a) Illustrate types of restricted Turing machines
7 b) Check whether the lists M=(abb, aa, aaa) and N=(bba, aaa, aa) have a Post
Correspondence Solution

Q.
Multiple Choice Questions
No
1 a In CFG normal of forms are represented in _____ ways
)
b Defne Greibach Normal Form
)
c A push down automaton employs ________ data structure.
)
d Push down automata accepts _________ languages.
) a) Type 3 b) Type 2 c) Type 1 d) Type 0
A PDA machine configuration (p, w, y) can be correctly represented as:
a) (current state, unprocessed input, stack content)
e
b) (unprocessed input, stack content, current state)
)
c) (current state, stack content, unprocessed input)
d) none of the mentioned
Which of the operations are eligible in PDA?
f) a) Push b) Delete
c) Insert d) Add
Which of the functions are performed by the turing machine after reading a symbol?
a) writes the symbol
g
b) moves the tape one cell left/right
)
c) proceeds with next instruction or halts
d) none of the mentioned
h 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.
i) The language accepted by a turing machine is called ____________
j) PCP stands for?
Q. Questions
No
a) Construct NPDA for L = { W WR /W ϵ ( 0 + 1)*} M = ({q1,q2},{0,1}.
{R,B,G},δ,q1,R,ϕ}
2
Illustrate about the notation of PDA and its Instantaneous description?

Construct CFG for the PDA = ({q0,q1}, {0,1}, {R,Z0}, δ, q0, Z0, Φ) and δ is given by
δ(q0,1,Z0)=(q0,RZ0)
δ(q0,1,R)=(q0,RR)
δ(q0,0,R)=(q1,R)
3 δ(q1,0, Z0)=(q0, Z0)
δ(q0,ε, Z0)=(q0,ε)
δ(q1,1,R)=(q1,ε)
b) Contrast between DPDA and NPDA
a) Convert the following grammar to Greibach Normal Form S→ABA | AB | BA | AA |
B
4 A→aA | a B→bB | b
b) Convert the following Context Free Grammar into Chomsky Normal Form S→aaaaS
| aaaa
a) Simulate a TM to recognize the language L= {0 n 1 n 0 n | n ≥ 1}.
5
b) Determine the Universal Turning Machine and Restricted Turing machine?
a) Explain TM halting problem.
6
b) Express the properties of recursive and recursively enumerable languages
a) Explain about post correspondence problem in detail
7
b) Discuss about P, NP, NP complete and NP hard problems.

Q.
Multiple Choice Questions
No
1 The pumping lemma is often used to prove that a language is:
a
a) Not context free b) Not regular
)
c) a & b d) None of the above
Which of the following grammars are in Chomsky Normal Form:
a) S->AB|BC|CD, A->0, B->1, C->2, D->3
b
b) S->AB, S->BCA|0|1|2|3
)
c) S->ABa, A->aab, B->Ac
d) All of the above
The moves in the PDA is technically termed as:
c
a) Turnstile b) Shifter
)
c) Router d) None of the above
d Statement: Every context free grammar can be transformed into an equivalent NPDA.
) a) true b) false
e A push down automata is said to be _________ if it has atmost one transition around
) all configurations.
f) A string is accepted by a PDA when
 a) Stack is not empty b) Acceptance state
c) Both the above d) None of the above
g _________________ can accept even palindromes over the input alphabet {a,b}
)
Halting problem has states are of two types.
h
a) Accept and Reject b) Reject and Allow
)
c) Start and Reject d) None of the above
According to the rice’s theorem, If P is a non trivial property, Lp is :
i) a) infinite b) decidable
c) undecidable d) loop forever
An algorithm is called efficient if it runs in ____________ time on a serial computer.
j)

Q. Questions
No
a) Construct a PDA to accept the language
L ={ anbn | n >= 1} by a final state. Draw the graphical representation of the
PDA.
2
b) Verify the above language to show the Instantaneous Description by the PDA for the
string aaabbb

a) Construct the PDA to the following grammar: S→aABC A→aB/a B→bA/b

3 C→a
b) List out the properties of PDA.
a) Examine the following grammar and convert it into Chomsky Normal Form
4 SABA A aA | Є B bB | Є.
b) Explain closure properties of Context Free Languages.
a) Construct a Turing Machine to implement addition of 2 numbers.
5
b) Summarize the extensions of Turing machine
a) Explain about Recursive language and Recursive enumerable languages.
6
b) Discuss briefly about decidability and undecidability problems.
a) Write a shot notes on post's correspondence problem and check the following is PCP
or not.

b) Explain Chomsky’s hierarchy of languages?