Scribd
Upload
31 views4 pages

Toc Ques

The document contains a series of questions and tasks related to formal languages, automata theory, and computational complexity. It covers topics such as Chomsky normal form, Turing machines, context-free languages, decidability, and NP-completeness. The document also includes practical exercises for converting grammars and designing automata.

Uploaded by

shrihari.m2006
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
31 views4 pages

Toc Ques

The document contains a series of questions and tasks related to formal languages, automata theory, and computational complexity. It covers topics such as Chomsky normal form, Turing machines, context-free languages, decidability, and NP-completeness. The document also includes practical exercises for converting grammars and designing automata.

Uploaded by

shrihari.m2006
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

1. State Chomsky normal form theorem.

2. Find an equivalent grammar for the following after eliminating


ε – productions.
S -> ASB | ε
A ->aAS | a
B ->SBS | A | bb
3. When is checking off symbols used in TM?
4. Give the instantaneous description of a TM.
5. Define Class P and NP problems. Give examples.
6. What is recursive enumerable language? Give example.
7. Differentiate between recursive and recursively enumerable languages.
8. Identify whether ‘Tower of Hanoi’ problem is tractable or intractable. Justify your
answer.
9. Is it True that NPDA is more powerful than that of DPDA? Justify your answer.
10. What are the conventional notations of PDA?
11. List the closure properties of Context free languages.
12. State the equivalence of PDA and CFL
13. List the features of Turing Machines.
14. Define a move in TM.
15. Compare decidable and undecidable language.
16. Explain recursive enumerable language? Give example.
17. Explain Diagonalization Language?
18. Interpret the examples of Class P and NP completeness Problems.
19. Convert to Chomsky normal form the following grammar G with productions.

S ->ABa
A -> aab
B ->Ac
20. Recall the formal definition of Push Down Automata
21. Show that L={ap/ P is prime } is not context free.
22. Define Turing Machine.
23. What are the differences between a Finite automata and a Turing machine?
24. Differentiate multihead and multi tape Turing machine.
25. Define decidable problems.
26. Write the Significance of NP-Complete Problem.
27. When we say a problem is decidable? Give example of undecidable problem.
28. What are the properties of recursively enumerable sets which are undecidable?
29. Construct a grammar for the language L which has all the strings which are all
palindrome over {a, b}.
30. Define Deterministic PDA.
PART-B

1. i) How CFG for L is converted into CNF accepting the same language? Convert the following
CFG into CNF:
S -> Ba | aB
A ->bAA | aS | a
B ->aBB | bS | b
ii) . Construct TM for the language L = { an bn } where n ≥ 1.

2. i) Convert the following grammar to GNF:

A1 ->A3A2 | A2A3
A2 ->A3A3 | A2A2 | a
A3 ->A2A2 | b
ii) Design a Turing machine that takes a binary number as input and increments the number
by 1.

3. i) Convert the following grammar into GNF

S->XY1/0,
X->00X/Y,
Y->1X1
ii) . Construct TM for the language L = { 1n 0n bn } where n ≥ 1.

4. i)Simplify the following grammar by eliminating null productions, unit production and
useless symbols and then convert to CNF.

S->ABC/BaB
A->aA/ BaC/aaa
B->bBb/a/D
C->CA/AC
D->ξ
ii) Design a Turing machine that takes a binary number as input and increments the number
by 1.

5. i) Prove that Post Correspondence Problem is Undecidable.

ii) Discuss Travelling Salesman Problem in terms of P and NP completeness.

6. i. Prove that Universal language Lu is recursively enumerable but not recursive”.

ii. Write note on NP complete problems and Polynomial time reduction.

7. (i) Construct PDA for L = { w Ɛ (a | b)* | where ‘w’ is a PALINDROME }


8. Construct PDA to recognize the grammar G with following productions and trace for a string
of acceptance and rejection.
S -> aSA | Ɛ
A ->bB | cc
B ->bd | Ɛ
9. i)Prove the theorem : if P1 is reduced to P2 then 1. If P1 is undecidable, then P2 is also
undecidable. 2. If P1 is non-RE, then P2 is also non-RE.
ii) Discuss Travelling Salesman Problem in terms of P and NP completeness.
10. i. Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive
language. Which one of the following is TRUE and why?

A.L1′ is recursive and L2′ is recursively enumerable

B.L1′ is recursive and L2′ is not recursively enumerable

C.L1′ and L2′ are recursively enumerable

D.L1′ is recursively enumerable and L2′ is recursive

ii. Write note on NP complete problems and Polynomial time reduction.

11. i) Show that the Language L={ aibici/ i>=1} is not context free.

ii) Discuss the closure properties of CFL.

12. What is the purpose of normalization? Construct the CNF and GNF for the following
grammar and explain the steps.

13. i)Prove that ̳If a language L and L‘ are recursively enumerable (RE) , then L is Recursive‘.

ii)Prove that the universal language Lu is recursively enumerable.

14. i)Prove that ―MPCP reduce to PCP‖.

ii)Discuss about the tractable and intractable problems.

15. Design a PDA to accept {0n1n|n>1}. Draw the transition diagram or the PDA. Show by
instantaneous description that the PDA accepts the strings‘0011‘.
16. Convert PDA to CFG.PDA is given by P=({p,q},{0,1},{X,Z}, δ,q,Z),δ is defined by
δ(p,1,Z)={(p,XZ)}, δ(p, ε,Z)={(p, ε)}, (p,1,X)={(p,XX)}, δ(q,1,X)={(q, ε,)}, δ(p,0,X)={(q,X)},
δ(q,0,Z)={(p,Z)}.
17. Consider the following PDA and find whether the string 000111 and 00011 is accepted.
18. Suppose the PDA P = ({p, q},s {0,1}, {z0, x},δ, q,z0,{p}) has the following transition functions:

δ(q,0,z0) = {(q, x)}


δ(q,0,x) = {(q, xx)}

δ(q,1,x) = {(q, x)}

δ(q, ε, x) = {(p,ε)}

δ(p, ε, x) = {(p,ε)}

δ(p, 1, x) = {(p,xx)}

δ(p, 1,) = {(p,ε)}

Starting from the initial ID (q, w, z0), show all the reachable instantaneous description where the
input string ‘w’ is as follows:

1. 01

2. 0011

3. 010

You might also like