Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
59 views2 pages

Automata Theory Assignment

This document contains the details of Assignment #2 for the course Theory of Automata II. It includes 5 questions related to pumping lemma, converting grammars to Chomsky Normal Form, proving languages are regular/non-regular, describing languages generated by grammars, and finding the language accepted by a given PDA. The assignment is worth 50 marks and is due on May 30, 2020.

Uploaded by

Jazmine
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
59 views2 pages

Automata Theory Assignment

This document contains the details of Assignment #2 for the course Theory of Automata II. It includes 5 questions related to pumping lemma, converting grammars to Chomsky Normal Form, proving languages are regular/non-regular, describing languages generated by grammars, and finding the language accepted by a given PDA. The assignment is worth 50 marks and is due on May 30, 2020.

Uploaded by

Jazmine
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

Assignment # 2

Course Name: Theory of Automata II Submission date: 30 May 2020


Instructor Name: Dr. Muhammad Younas Marks: 50 marks

Questions # 1.
Explain the term “pumping lemma” , also describe (5) five examples of pumping
lemma to explain its application.
Questions # 2.

a) Convert the following CFG into Chomsky Normal Form (CNF)


S  ASA | aB
A B | S
Bb|^
b) construct an FA that accepts the grammar
S→abA

A→baB

B→aA|bb

Questions # 3.
a) Prove that L = {anbn : n > 0} is not regular.
b) language EQUAL, of strings, defined over Σ={a,b}, with number of a’s equal
to number of b’s, i.e. EQUAL = {Λ , ab, aabb, abab, baba, abba,…} prove
that the above language is non-regular

Questions # 4.

a) Give a simple description of the language generated by the grammar with


productions
I. II.
SAa | ʎ SAa | ʎ
AbS AB
B Aa

b) Find grammars for {a, b} that generate the sets of


I. all strings with exactly one ‘a’
II. all strings with at least one ‘a’
III. all strings with no more than three a’s.
IV. all string with even no of ‘a’ even no. of ‘b’ say EVEN-EVEN
Questions # 5.

Consider the following PDA. Write the Language accepted by it. (show all process)

You might also like