Scribd
Upload
40 views2 pages

QB Toc

Uploaded by

jnvarshitha1709
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
40 views2 pages

QB Toc

Uploaded by

jnvarshitha1709
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/ 2

1.

Using the Pumping Lemma for Context free grammars prove that L = { x E {0,1}, |x| is a perfect
square }.

2. With a neat diagram explain the Turing Machine, Write a Turing machine to accept 0n1n2n.

3 . Define CFG. Write CFG to specify

i) all strings over {a,b} that are even and odd palindromes.

ii) L = (anb2n over ∑={a,b} n≥1}.

4. Discover whether the following grammar is ambiguous or not

S → aSb | bSa | SS | ε for the string “aabb”.

B. Define Ambiguity. Consider the grammar E->E+E | E*E | (E) | id. Show that the grammar is
ambiguous.

5. Explain the following with examples. i) Decidability ii) Decidable languages iii) Undecidable
Languages.

6. Construct a Turing Machine that can accept the set of all even palindromes over {0,1}.

7. What is Turing Machine? Give a formal notation for a Turing machine explaining each of the
tuples. Design a Turing Machines which generates a set of string with equal numbers of 0’s and 1's.

8. Explain the following with examples

i)Ambiguous Grammar

ii)Pare Tree

9. Prove that the given grammar is ambiguous

E-> E+E| E*E| (E)|id

10. Obtain the LMD and RMD for the following grammar

S-> AbB

A->aA|€

B->aB/bB|€

D->a|€

11.Construct PDA for the given language L-{an bn for n>=1}

12. State and explain Pumping lemma for CFG.


13. Explain in detail Chomsky's Normal Form

14. Check whether the given language L = {xnynzn | n ≥ 1} is regular CFG or not.

15. Prove that CFG are closure under union.

16. Design Turing machine to accept the language L={an bn cn for n>=1}.

17. Define Turing Machine.Explain turing machine model in detail.

18. A. Convert the following grammar to CNF

You might also like