Scribd
Upload
20 views4 pages

Module 3 To 6 MU Qs

Uploaded by

shreyy180605
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
20 views4 pages

Module 3 To 6 MU Qs

Uploaded by

shreyy180605
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

Module 3

• Construct CFG to generate language L = {a^i b^j c^k / k = i + j, i,


j >=1}. (5M) - June 24

• The Grammar G is:


S → aB/bA
A → a/ aS/ bAA
B → b/ bS/ aBB
Derive LMD, RMD for string "aaabb" and draw parse tree. (10M)

• Consider following CFG. Is it already simplified? Explain your answer. Convert it to


CNF form.
S → ASB/ a/ bb
A → aSA/ a
B → SbS/ bb (10M)

• Short note on: Chomsky Hierarchy. (5M)

• Simplify given grammar:


S → ASB/ ε
A → aAS/ a
B → SbS/ A/ bb (5M) - Nov 23

• Construct CFG for L = {0^i 1^j 0^k / j > i + k} (5M)

• Grammar G is:
S → aB/ bA
A → a/ aS/ bAA
B → b/ bS/ aBB
Obtain parse tree for string "aababbb." Check if the grammar is ambiguous. (5M)

• Find CNF for the given CFG:


S → AA/ a
A → SS/ b (10M)
• Explain with example Chomsky Hierarchy. (10M) - May 23

• Grammar represented by the following production rules:


S → S+S/ S-S/ S*S/ S/S/ (S)/ a
Find if it's ambiguous. (5M)
• Explain Chomsky Hierarchy. (5M)

• Write Steps to convert CFG to CNF. Convert the following CFG to CNF:
S → ASB/ Epsilon
A → aAS/ a
B → SbS/ A/bb (10M)

• Construct CFG: (10M)


1. Alternate sequence of 0 & 1 starting with 0. (3M)
2. Don't contain 3 consecutive a over Σ = {a,b}. (4M)
3. L = {x ∈ {0,1}* | x has equal no. of 0's & 1's}.* (3M)
• Show that the following grammar ambiguous?
S → aSbS/bSaS/ ε (5M) - Nov 22
• Consider the following grammar G = (V,T,P,S) where V = {S, X} & T = {a, b}. and
Productions are given:
S → aSb /Xa
X → Xa/Sa/a
Convert into GNF. (10M)
• For S → iCtS / iCtSeS / a
C→b
for string ibtaeibta find LMD & RMD & Parse Tree of Ambiguity. (5M)

• Short note on Chomsky Hierarchy. (10M)


MODULE 4

June-24
1. (a) Ways of acceptance by PDA [5M]
2. (b) Give formal definition of PDA. Design PDA that accepts odd palindromes over {a, b, c}
where 'c' exists only at the center of every string [10M]

Dec-23
1. (b) Design PDA that accepts L = {am bn cn dm / m, n ≥ 0} [10M]

May-23
1. (c) Differentiate between NPDA & PDA [5M]
2. (a) Construct a PDA for accepting L = {an bm cn / m, n ≥ 1} [10M]

Nov-22
1. (a) Construct PDA accepting L = {an bn / n ≥ 0} [10M]
2. (d) Define & working of PDA [5M]
MODULE 5 & MODULE 6

June-24 [25M]
1. (b) TM for input binary number to its 1’s complement of a number. [10M]
2. (b) Short note on:
1. Post Correspondence Problem
2. TM - Halting Problem
3. Variations of TM [15M]

Nov-23 [25 Marks]


1. (b) Define and design TM to accept 0^n 1^n 2^n over Σ={0,1,2}. [10M]
2. (b) Post Correspondence Problem. [5M]
3. (c) Recursive & Recursively Enumerable Language. [5M]
4. (d) TM - Halting Problem. [5M]

May-23 [20M]
1. (b) Design a TM accepting all palindromes over {0,1}. [10M]
2. (b) PCP Problem. [5M]
3. (c) Variations of TM. [5M]

Nov-22 [35 Marks]


1. (c) Variants of TM. [5M]
2. (b) Construct TM to check well-formedness of parenthesis. [10M]
3. (a) Design TM that computes f(m,n)=m+n ,the addition of 2 integers. [10M]
4. (c) Short note on Rice's Theorem. [10M]

You might also like