Scribd
Upload
58 views4 pages

Toc Assignment No-04. 2024

Uploaded by

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

Toc Assignment No-04. 2024

Uploaded by

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

Theory of Computation TE(2019) Computer Engineering

MET’s Institute of Engineering, Nasik.


THEORY OF COMPUTATION
DEPARTMENT OF COMPUTER ENGINEERING
Subject : TOC ASSIGNMENT NO – 04 Unit : IV

THEORY QUESTION

1. Define PDA. What are different types of PDA? Applications of PDA?


2. Prove that "Let L be a language accepted by deterministic PDA, then the complement
of L, can also be accepted by, deterministic PDA
3. Proves the CFL are Closed under Union, Concatenation and Kleene’s closure.
4. Show that CFL are closed under intersection and Complementation.
5. Explain the working of top down parser and bottom up parser with example.
6. Differentiate between FA and PDA.
7. What are different ways to define PDA Acceptability
8. Explain acceptance by PDA

i ) By Final State
ii ) By Empty state
9. Explain Closure property of PDA with suitable example.

POSTDOWN AUTOMATA (PDA)

10. Construct PDA that accepts the language by the following CFG.SSS| (S) | ( )
11. Construct a PDA that accept the language generated by grammar
i) S0S1| A, A1A0|S|€
ii) SaABB|aAA, AaBB|a,BbAA|A
12. Design a PDA for accepting a language L = {an bm cn | m,n>= l}
13. Design a PDA for accepting Language L = {W c WR | W ∈ (a,b)*}.
14. Construct PDA that accepts following language L  anbn | n  0.Write simulation
for string ‘aaabbb’
n 2n
15. Design a PDA for the following LanguageL = {a b | n >=0}
16. Show that: L  anbncn | n 1 not a CFL
SPPU University asked questions from 2015-2023 Prepared By : Mr. Anand Gharu
Theory of Computation TE(2019) Computer Engineering
2n n
17. Design a PDA for the following LanguageL = {a b | n >=1} n=3
18. Construct PDA that accepts all palindrome string over {a, b} . Specifysimulation
for string ‘aba’
r r
19. Design a PDA for a languageL={XcX |X€{a,b}* and string X is the reverse of string
X}.

CFG TO PDA

20. Convert following CFG to PDA


S -> aSb | A
A -> bSa | S | Ɛ

21. Construct a PDA equivalent to following CFG


i)
X0
X  0X
X  1XX
X  XX1
X  X1X

ii) SBD|BC
DSC
CAA
B0
A1

22. Construct PDA for the following Regular Grammar :


S  0A | 1B | 0
A  A0 | B
B c|d

NPDA

2n
23. Construct a NPDA that accept the language L = { a | n > 0}
24. What is NPDA? Construct a NPDA for the set of all strings over {a,b} with odd length
palindrome.
25. Construct the NPDA that accepts the language generated by
` S=S+S|S*S|4
Show the acceptance of the input string 2 + 2*4 by this PDA

SPPU University asked questions from 2015-2023 Prepared By : Mr. Anand Gharu
Theory of Computation TE(2019) Computer Engineering
PDA TO CFG

26. Construct a context free grammar which accepts N(A), where


A = ({q0,q1}, {0,1}, {Z0,Z}, , q0, Z0, }where is given by
q0, 1, Z0) = {(q0, ZZ0)}
q0, Z0) = {(q0,)}
q0, Z) = {(q0, Z Z)}
q0, Z) = {(q1, Z)}
q1, Z) = {(q1, )}
(q1, Z0) = {(q0, Z0)}

27. Give Context Free Grammar (CFG) generating the language accepted
by the PDA M = {(q0, q1), (a ,b), , q0, Z0, q1} where δ is as follows.
1. (q0, a, Z0)  (q0, XZ0)
2. (q0, a, X)  (q0, XX)
3. (q0, b, X) (q1, ∈)
4. (q1, b, X) (q1, ∈)
5. (q1, ∈, Z0)  (q1, ∈)

28.

29.

SPPU University asked questions from 2015-2023 Prepared By : Mr. Anand Gharu
Theory of Computation TE(2019) Computer Engineering
30.

MISCELLNEOUS EXAMPLES

31.

32.

*********************THE END********************

SPPU University asked questions from 2015-2023 Prepared By : Mr. Anand Gharu

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