PMAS Arid Agriculture University Rawalpindi

University Institute of Information Technology

CS 729 : Theory of Automata and Formal Languages 3(3-0)
Class: MCS-2 (Evening) Instructor: Sheeraz Akram Email: sheeraz@uaar.edu.pk sheeraz.cs@gmail.com Website: Counseling Hours: Pre-requisites: Course Description: CS-323 This is an introductory course on the theory of computation. Students are introduced to the concept of formal languages and automata. Formal languages cover regular grammar, regular expression, context free grammar and language. In automata they shall learn about finite automata (deterministic and nondeterministic) and pushdown automata. They shall also learn about fundamental concepts of Turing machines. The main goal of this design DFAs, PDAs for different languages and having a taste of computational models. After studying Regular languages and CFL, the student will be able to have understanding about a basic compiler. The student will have understanding of computational model with Random Access Memory with reference of Turing Machine. REQUIRED TEXTS: Introduction to Automata Theory, Languages, and Computation, 2/E, John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Addison-Wesley 2001. ISBN 0-20144124-1. Introduction to Computer Theory 2/E Daniel I. A. Cohen John Wiley & Sons, Inc 1997. ISBN 0471-13772-3 Introduction to Formal Languages and Automata Peter Linz, D. C. Heath and Company, 1990. ISBN: 0-669-17342-8. Handouts. Semester: Spring 2011 Office: Room No. 05, UIIT, PMASAAUR

Course Outcomes:

Books:

REFERENCES:

PMAS Arid Agriculture University Rawalpindi

University Institute of Information Technology
Tentative Grading Policy: Plagiarism Policy: 18 Mid Tem Exam 30 Final Exam 04 Assignments & 08 Quizzes

Collaboration and group work is encouraged but each student is required to submit his/her own contribution(s). Your writings must be your own thoughts. Cheating and plagiarism will not be tolerated and will be referred to the Dean for appropriate action(s).

Quiz/Assignments Policy

Quizzes: Quizzes will be unannounced some time, but tentative plan of quizzes is given in the outline. They will be taken either in the first ten minutes of the class (so come to the class on time & be prepared!) or in the last ten minutes of the class (so listen to the lecture carefully). If you miss a quiz, you miss it! Its up to the instructors discretion to choose the number of quizzes for evaluation purposes.

Assignments: Tentative number of Assignments is given in the outlines. Assignments will be submitted on time. You will have 10 hours to submit the assignment after the due date & time. However, 10% marks will be deducted for every passing hour after the due time. Copying/Cheating whole or part of the assignment from anywhere without proper credit/references will not be tolerated. Whether you have copied or your work has been copied by someone else, you will get zero marks in that assignment. Project Work
Students will be given a practical nature problem and at the end, each group will make a presentation of his/her work and/or give a demo of the project.

Week # 01 Introduction to Automata Review of proof techniques Introduction to Automata Introduction to Formal Languages Alphabet sets and Languages Finite and Infinite Languages Kleen Closure and Positive Closure Recursive Definitions

PMAS Arid Agriculture University Rawalpindi

University Institute of Information Technology

Week # 02: Finite Automata Finite State Automata Deterministic Finite State Automata (DFA) Non Deterministic Finite State Automata (NFA) Week 03: (Quiz 01, Assignment 01) Finite Automata Equivalence of NFA and DFA Epsilon NFA Regular Expressions & Languages Regular expressions Week # 04 Regular Expressions & Languages Regular Grammars Finite Automata and Regular Expressions Week # 05 (Quiz 02, Assignment 02) Properties of Regular Languages Algorithms for Regular Languages Week 06: Properties of Regular Languages Algorithms for Regular Languages Finite Automata with output Moore Machines/Mealy Machines Week 07: (Quiz 03, Assignment 03) Regular Languages Regular and Non regular Languages Decidability Context-free Languages (CFL) Context-free grammars (CFG) Week # 08: Context-free Languages (CFL) Parse Trees Derivations and ambiguity Week # 09 & 10: Mid Term

PMAS Arid Agriculture University Rawalpindi

University Institute of Information Technology
Week # 11: Push down automata (PDA) Introduction Language accepted by PDA Deterministic PDAs Non-Deterministic PDA Week # 12: Context Free Language (CFG) Context Free Language (CFL) PDA/CFG Equivalence Week # 13: (Quiz 04, Assignment 04) Properties of Context-free Languages Chomsky-normal-form grammars Equivalence of PDA and CFG Pumping Lemma (Introduction) Week # 14: Properties of Context-free Languages Pumping Lemma Closure Properties Week # 15: (Quiz 05, Assignment 05) Properties of Context-free Languages Algorithms for CFLs Turing Machines Introduction Language of a Turing Machine Variations Week # 16: Turing Machines Acceptors/Transducers Week # 17: (Quiz 06, Assignment 06) Decidability Recursive & recursively enumerable languages Some real un-decidable problems Week # 18: Intractable Problems P, NP Classes NP-complete problems

PMAS Arid Agriculture University Rawalpindi

University Institute of Information Technology
Week # 19 & 20: Final Exam