University of Engineering & Technology Taxila

Department of Computer Science

CS 302: Theory of Automata and Formal Languages (3+0): BSCS 2K17 Fall 2019

Assignment 3
CLO:
Maximum Marks: 100 Instructor: Abid Rauf
Announcement Date: 17th October 2019 Due Date : 24th October 2019 (in Class Submission)

Instructions:

Reference Assignment 1 (Task 1)

Hand written assignment. Use A4 white pages. (Attached the printed code with your assignment where
needed)

Tasks:

1- Construct a minimum DFA for Long Tennis game. You can use the DFA constructed in
Assignment 1 (Task 1) (30 Marks)

2. Write a Regular expression for the following FA. (20 Marks)

3. Implement the Regular Expression using Thomson’s Construction (You can use 30% code from
internet). Also give the reference from the site you took code. Also see the following link for help
https://deniskyashif.com/implementing-a-regular-expression-engine/ (50 Marks)