0% found this document useful (0 votes)
36 views1 page

HW3C1801

This document contains homework questions on automata theory for a course with code CSE321. It has two parts with a total of 6 questions. Part A contains 3 questions about designing context-free grammars and derivations for specific languages. Part B contains 3 questions about Chomsky normal form, Kuroda normal form, and constructing grammars for specific languages.

Uploaded by

Manisha Mattu
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
36 views1 page

HW3C1801

This document contains homework questions on automata theory for a course with code CSE321. It has two parts with a total of 6 questions. Part A contains 3 questions about designing context-free grammars and derivations for specific languages. Part B contains 3 questions about Chomsky normal form, Kuroda normal form, and constructing grammars for specific languages.

Uploaded by

Manisha Mattu
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

LOVELY PROFESSIONAL UNIVERSITY

HOME WORK: #3

School: LST Department: CSE/IT


Course Code: CSE321 Course Title: Automata Theory
Section: C1801 Max. Marks:07

Part-A

Q1. Design a CFG for the Language:

L (G) = {ab (bbaa)n bba (ba)n : n ≥ 0}

Q2. Consider the following productions:

S → aB/bA
A → bAA/aS/a
B → aBB/bS/b

For the string aaabbabbba, Find:


i) Leftmost derivation
ii) Rightmost derivation and
iii) Parse tree.

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

S → 1A/0B
A → 1AA/0S/0
B → 0BB/1S/1
Part-B

Q4. Compare the Chomsky Normal form and Kuroda Normal Form. Give example of each.

Q5. Write a CFG which generates strings having equal number of a’s and b’s.

Q6. Let L = { anbm | n < m }. Construct a context free Grammar accepting L and convert it into GNF.

You might also like