BAHRIA UNIVERSITY

13 NATIONAL STADIUM ROAD, KARACHI

+ 92 21 924 0002-6
FAX: + 92 21 924 0351
bukc.bahria.edu.pk

TEACHING PLAN

Course Title: Theory of Automata

Course Code: CSC-315
Credit Hours: 3+0
Contact Hours: 3 hours lecture per week
Semester: Semester 4 (Fall 2020) Section A & B
Prerequisite(s): None
Instructor(s): Dr Raheel Siddiqi
Website: Learning Management System (LMS)
Objectives: The objectives of this course is:

 To understand the basic structure of language as a function of a grammar

 To design deterministic and non-deterministic automata
 To apply Pumping Lemma for language classification
 To associate memory with automata (Push Down Automata)
 To design Turing Machine for different languages

Outcomes: After completing this course, the student should be able to:

 Transform uncertainty into deterministic automata

 Design the automata for a given regular language
 Differentiate regular and irregular languages

Synopsis: Languages, Kleen's Closure, Recursive Definitions, Regular Expressions, Finite and Infinite languages, Regular
Languages, Non-Regular Languages, Finite Automata with output, Finite Automata and their languages,
Transition Graphs, Non-determinism, Non-Regular Languages, The Pumping Lemma, Context Free Grammars,
Tree, Ambiguity, Pushdown Automata, Decidability
COURSE SCHEDULE:

WEEK DATE TOPICS/SUBTOPICS LAB/TUTORIAL QUIZ/ASSIGNMEN REMARKS

T
01 21/09/2020 INTRODUCTION
– Course Outline, Basics of Theory of
27/09/2020 Automata
02 28/09/2020 GRAMMAR AND LANGUAGES
Grammar and NLP,
– Grammar and Languages-I
04/10/2020 Grammar and Languages-II
03 05/10/2020 CONTEXT FREE GRAMMAR
Ambiguity in CFG, Simplification of
– CFG Removal of Unit Productions,
11/10/2020 CHOMSKY Normal Form for CFG
04 12/10/2020 FINAL STATE AUTOMATA
GREIBACH Normal Form for CFG Quiz_01
– Final State Automata(FSA)-I
18/10/2020 Final State Automata(FSA)-II
05 19/10/2020 NON DETERMINISTIC FSA
Non- Deterministic FSA
Non- Deterministic FSA with Ɛ - Assignment_01
(Epsilon) - Moves
– Equivalence between FSA and Type-3
25/10/2020 Grammars
06 26/10/2020 REGULAR EXPRESSION
Regular Expressions
– Regular Expressions to NFSA
01/11/2020 DFSA to Regular Expressions
07 02/11/2020 FSA WITH OUTPUT
MOORE and MEALY Machines and
– Conversion between Machines
 08/11/2020
08 09/11/2020
– Revision for Midterm
15/11/2020
09 16/11/2020
– MIR-TERM EXAMINATION WEEK
22/11/2020
10 23/11/2020 PUMPING LEMMAS
AND
MYHILL-NERODE THEOREM
Pumping Lemmas for Regular Sets and
– CFL, MYHILL-NERODE Theorem
30/11/2020 Minimization of DFSA.
11 01/12/2020 PUSHDOWN AUTOMATA
– CFG TO PDA Conversion
06/12/2020 PDA TO CFG Conversion
12 07/12/2020 TURING MACHINES
– Introduction to Turing Machines
13/12/2020 Application of Turing Machines
13 14/12/2020 TURING MACHINES
– Turing Machine as Acceptor Quiz_02
20/12/2020 Techniques for TM Construction
TM as a Generating Device
14 21/12/2020 TURING MACHINES AND
– DECIDABILITY
27/12/2020 Recursive Sets
Encoding of TM and Halting Problem Assignmen_02
Universal TM and Decidability
RICE'S Theorem
Linear Bounded Automata
15 28/12/2020 POST'S CORRESPONDENCE
– PROBLEMS
03/01/2021 POST'S Corresponding Problems
 Time and Tape Complexity of TM
NP - Complete Problems, COOK'S
Theorem
16 04/01/2021 REGULAR REWRITING AND L-
– SYSTEM Quiz_03
10/01/2021 More NP- Complete Problems
Regulated Rewriting, L-Systems
17 11/01/2021
– Revision Week
17/01/2021
18 18/01/2021
– FINAL EXAMAMINATION WEEK
25/01/2021
COURSE EVALUATION:

Type of Assessment Percentage (%) Remark

Course Work 30 Quiz (Total = 10)
Assignment (Total = 20)
Mid-Term Exam 20 Mid-Term (Total = 20)
Objective 08 Marks and Subjective 12 Marks
Final Exam 50 Final (Total = 50)
Objective 20 Marks and Subjective 30 Marks

TEXT BOOKS:

“Introduction to Formal Languages, Automata Theory and Computation” by Kamala Krithivasan and
Main
Rama R.
An Introduction to Formal Languages and Automata - 5th Edition By Peter Linz, 2011
Reference
Daniel I. A. Cohan, Introduction to Computer Theory, John Wiley & Sons Inc.2ND edition, 2010

GRADING SCHEME:

Marks Grade Marks Grade

87 – 100 A 50 – 59 D
80 – 86 B+ < 50 F
72 – 79 B Withdraw W
66 – 71 C+ Incomplete I
 60 – 65 C - -

COURSE POLICY:

Homework  homework are due at the beginning of class,

(Assignments)  Late homework will not be accepted,
 All works have to be done independently,
 Students handing in similar homework will receive a grade of 0 (ZERO) and face possible disciplinary
actions.
Makeup Exams Makeup exam cases are forwarded to Examination Department

Attendance  Students are expected to attend all classes

 Attendance is compulsory and will be taken regularly.
 Attendance for less than 80% of the lectures will result in students being barred from taking the Final
Exam.
Code of Conduct The assignments, quizzes and exams need to be done individually. Copying of another student's work, even if
changes are subsequently made, is inappropriate and such work or code will not be accepted. The University
has very clear guidelines for academic misconduct, and they will be enforced in this class.
Cell Phone Cell phones are restricted during class. Cell phones must be turned off during the lecture. If your cell phone
rings during class, you may be asked to leave.

*It is acknowledged that the objectives, synopsis of the course and distributions of examination marks will not be changed in the
framework of the course as certified.

_______________________
Dr Raheel Siddiqi
Signature of Instructor
Date:

_______________________
Dr. Humeera Farooq
Validated by Head of CS Department