Scribd
Upload
54 views3 pages

Cia2 QB

The document is a question bank for a course on Theory of Computation, containing two parts: Part A includes theoretical questions on topics like PDA, CFG, Turing machines, and complexity classes, while Part B consists of practical problems requiring the construction of PDAs and Turing machines, as well as grammar conversions. Key concepts addressed include the equivalence of PDAs and CFGs, closure properties, decidability, and the classification of problems in computational complexity. It serves as a comprehensive study guide for students preparing for assessments in this subject.

Uploaded by

anusiyaambamani
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
54 views3 pages

Cia2 QB

The document is a question bank for a course on Theory of Computation, containing two parts: Part A includes theoretical questions on topics like PDA, CFG, Turing machines, and complexity classes, while Part B consists of practical problems requiring the construction of PDAs and Turing machines, as well as grammar conversions. Key concepts addressed include the equivalence of PDAs and CFGs, closure properties, decidability, and the classification of problems in computational complexity. It serves as a comprehensive study guide for students preparing for assessments in this subject.

Uploaded by

anusiyaambamani
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/ 3

CS3452- THEORY OF COMPUTATION

CIA – 2 QUESTION BANK

PART - A

1. Explain the equivalence between PDA and CFG


2. Is it true that non – deterministic PDA is more powerful that deterministic PDA? Justify?
3. Relate the steps to how eliminate useless symbols
4. Infer each of these languages is not to be context-free{aibjck|i<j<k}
5. Tabulate the difference between CNF and GNF
6. Classify the Turing machine with example
7. When a language is said to be recursively enumerable?
8. Contrast the class P and NP.
9. Distinguish between tractable and intractable
10. How to prove that the post correspondence problem is undecidable

11. Expressthe ways of languages accepted by PDA and define them?


12. Is it true that non – deterministic PDA is more powerful that deterministic PDA?Justify?
13. What are the closure properties of CFG?
14. Define Turing Machine.
15. What is a Turing Machine and how is it different from a finite automaton?
16. How a Turing Machine uses symbol replacement in recognizing patterns.
17. When a language is said to be recursively enumerable?
18. Define the class P and NP.
19. When we say a problem is decidable? Give example of undecidable problem
20. What is UTMs or Universal Turing machines?

PART - B

1. Construct the PDA for the Language L= {WCWR | W is in (0+1)*


2. Construct the Deterministic PDA for even length of polindrome
3. Convert the following grammar into an equivalent grammar in CNF
SbA/aB AbAA/aS/ a B aBB/bS/b
Convert the following grammar into an equivalent grammar in GNF
SAA/a ASS/b
4. Use the pumping lemma to show that the language L={0n1n2n∣n≥1} is not context-free.
5. Construct a Turing Machine for multiplying two non negative Integers using
subroutine.
6. Construct a Turing Machine to accept the language L={anbn∣n≥1}. Use appropriate
programming techniques for TM construction.
7. Apply the diagonalization technique to construct a language that is not recursively
enumerable.
8. Classify the optimization and decision versions of TSP in terms of P, NP, and NP-complete
classes, and justify your classification.
9. Apply the concept of reductions to show how an instance of the 'MPCP' problem can be
transformed into an instance of the 'PCP' problem, and explain why this is a valid
polynomial-time reduction.
10. Apply your understanding of tractability to determine whether the following problem is
tractable or intractable: Given a large dataset, find the most frequent item using any
algorithm. Justify your answer based on the problem’s time complexity.
11. 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)}.
12. Use the given PDA to create a Context-Free Grammar (CFG) by following the conversion
process. Justify each production rule you generate based on the transitions in the PDA. N(M),
where M=({q0, q1},{a,b},{z0,z},δ,q0,z0,Φ) and where δ is given by δ(q0,b,z0)={(q0,zz0)}
δ(q0,ε,z0)={(q0,ε)} δ(q0,b,z)={(q0,zz)} δ(q0,a,z)={(q1,z)} δ(q1,b,z)={(q1,ε)
δ(q1,a,z0)={(q0,z0)}

13. Construct the PDA for the Language L= {WCWR | W is in (0+1)*


14. Examine the PDA into CFG.
M = ({q0, q1}, {0, 1}, {X, Z0}, δ, q0, Z0, Φ)
δ (q0,0, z0) = {( q0, XZ0)}, δ (q1, 1, x) = {( q1,∈)} δ (q0, 0, X) = {( q0, XX)},
δ (q1, ∈, X) = {( q1, ∈)}, δ (q0, 1, X) = {( q1,∈)}, δ (q1, ∈, Z0) = {( q1,∈)}
15. i) Find an equivalent grammar in CNF for the grammar:
SbA/aB AbAA/aS/ a BaBB/bS/b
ii) Construct the following grammar in GNF
SAA/a ASS/b
16. State pumping lemma for CFG. Use pumping lemma to show that the language L={aibjck /
i<j<k } is not CFL also discuss about any four closure properties of CFL.
17. Construct a Turing Machine for multiplying two non negative Integers using
subroutine.
18. Explain the programming techniques for TM construction with real time example
19. Discuss the difference between NP-complete and NP-hard problem
20. Let ∑ ={0,1} ,Let A and B be the list of string defined as
List A List B
i Wi xi
1 1 10
2 110 0
3 0 11

Find the instance of MPCP.


ii) Show that 3-CNF SAT is NP complete.
21. Find the following languages are recursively enumerable.
i)Union of recursively enumerable languages.
ii)L and complement of L are recursively enumerable.
22. Explain tractable and intractable problem with suitable example
11. Construct a PDA for the bellow mentioned language: L(G)={ w| w€(a,b,c,d) and w is
of the form anbmcmdn and (m,n)>+1}.Also mention the state transitions of this PDA
while parsing the string W=’aaabbccddd’.
12 Construct a Turing machine to accept the following language. L(G)={w| w€(0,1) and w
is the form 0n1n where n>=1}

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy