LOVELY PROFESSIONAL UNIVERSITY

HOME WORK: #3

School: LSECA Department: CSE/IT

Name of the faculty member: Anup Singh Kushwaha Course Code: CSE321

Course Title: Automata Theory

Class: Term: Section: Batch:

Max. Marks: 7 Date of Allotment:3/24/2011 Date of Submission:

Part-A

Q1. Design a CFG for the Language:

L (G) = {01 (1100)n 110 (10)n : n ≥ 0}

Q2. Show that the following grammar is ambiguous.

S → AB/aaB
A → a/Aa
B→b

Q3. Convert CFG which is given below in to CNF form.

S ➞ abAB

A ➞ bAB | λ
B ➞ BAa | A | λ
Part-B
Q4. Compare the Chomsky Normal form and Kuroda Normal Form. Give example of each.

Q5. Write a CFG for the regular expression

i) r = a*b(a + b)*
ii) r = (0 +1)* 00 (0 + 1)*
n m
Q6. Let L = { 0 1 | n < m }. Construct a context free Grammar accepting L and convert it into GNF.