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

Scribd
Upload
7 views2 pages

TAFL Assignment 2

This document is an assignment paper for the Theory of Automata & Formal Languages course at the United College of Engineering & Research for the 2024-25 session. It includes short and long answer questions related to key concepts such as Arden's Theorem, Kleen's Theorem, and properties of regular languages, with a total of 20 marks. The assignment is due on May 15, 2025, and all questions are compulsory.

Uploaded by

shivammaurya09721
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
7 views2 pages

TAFL Assignment 2

This document is an assignment paper for the Theory of Automata & Formal Languages course at the United College of Engineering & Research for the 2024-25 session. It includes short and long answer questions related to key concepts such as Arden's Theorem, Kleen's Theorem, and properties of regular languages, with a total of 20 marks. The assignment is due on May 15, 2025, and all questions are compulsory.

Uploaded by

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

United College of Engineering & Research, Prayagraj

Department of Computer Science and Engineering


Assignment Paper, Session 2024-25

Assignment No.: 2 Semester: IV


Course Name: Theory of Automata & Formal Languages Max. Marks: 20
AKTU Course Code: BCS402
Last Date of Submission: 15/05/2025
Note: All questions are compulsory.

Section-A

Ques. Short Answer Type Questions CO Bloom’s Marks


No. Level
1. State Arden’s Theorem. CO-2 L1 1
2. State Kleen’s Theorem. CO-2 L1 1
3. Explain Right Linear grammar and Left Linear grammars with 1
CO-2 L2
examples.
4. 1
CO-2 L3
Write a Regular expression that generates strings with even number
of a’s and even number of b’s.
5. Explain decision properties of regular languages. CO-2 L2 1

Section-B

Ques. Long Answer Type Questions CO Bloom’s Marks


No. Level
1. State and prove Arden’s theorem. Also find the regular expression 3
corresponding to the finite automata given below:

CO-2 L3

2. Use Pumping Lemma for the following languages to: 3


CO-2 L3

3. Find the minimized DFA corresponding to the following regular 3


CO-2 L3
expression using Kleen’s theorem: R = 00(0+1)* + (0+1)*11
4. Prove that the Compliment, Union, Intersection, and Reversal of a 3
CO-2 L3
Regular language are also Regular.
5. Construct a right linear and left linear grammar for the following FA: 3

CO-2 L3

CO - Course Outcome

Bloom’s Levels

1- Remembering 2-Understanding 3-Applying 4-Analyzing 5-Evaluating 6-Creating

You might also like