Scribd
Upload
39 views4 pages

Theory of Automata

thoery of automata

Uploaded by

Shan Ali5656
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
39 views4 pages

Theory of Automata

thoery of automata

Uploaded by

Shan Ali5656
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

University of Management and Technology

Course Outline
Course code: XI531 Course title: Theory of Automata

Program MCS

Credit Hours 3

Duration 16 Weeks

Prerequisites None

Resource Person Hamna Malik

Counseling Timing Wednesday: 11:00 – 2:00


(Room# ) Office No. 24

Contact [email protected]

Chairman/Director signature………………………………….

Dean’s signature…………………………… Date………………………………………….

Course Outline Page 1


Learning Objective:
At the end of the course the students will be able to:

1. Explain and manipulate the different concepts in automata theory and formal languages such as
formal proofs, automata, regular expressions, Turing machines etc;

2. Prove properties of languages, grammars and automata with rigorously formal mathematical
methods.

3. Design of automata, RE and CFG.

4. Transform between equivalent NFAs, DFAs and REs.

5. Define Turing machines performing simple tasks.

6. Differentiate and manipulate formal descriptions of languages, automata and grammars with focus on
regular and context-free languages, finite automata and regular expressions.

Learning Methodology:
Lectures, Written Assignments, Semester Project, Presentations

Grade Evaluation Criteria


Following is the criteria for the distribution of marks to evaluate final grade in a semester.

Marks Evaluation Marks in percentage


Quizzes 15

Assignments 5

Mid Term 25

Attendance & Class Participation 5

Term Project 7

Presentations 3

Final exam 40

Total 100

Recommended Text Books:


Introduction to computer theory, Daniel I. A. Cohen, 2nd Edition

Reference Books:

Course Outline Page 2


1. Automata, Computability and Complexity: Theory and Applications, by Elaine Rich, 2011 An
Introduction to Formal Languages and Automata, by Peter Linz, 4 edition, Jones & Bartlett
Publishers, 2006

2. Theory of Automata, Formal Languages and Computation, by S. P. Eugene, Kavier,2005, New


Age Publishers

Course Outline Page 3


Calendar of Course contents to be covered during semester
Course code: XI531 Course title: Theory of Automata

Week Course Content Book Chapter

1 Language definitions preliminaries, Regular expressions/Regular 2, 4


languages

2 Finite automata (FAs) 5

3 Transition graphs (TGs), NFAs. 6

4 Kleene’s theorem 7

5 Transducers (automata with output) 8

6 CFGs, Derivations, derivation trees and ambiguity 12

7 Normal form grammars and parsing 13

8 PDA 14

9 Turing Machines Theory: Turing machines 19

10 Post machine 20

11 Variations on TM, TM encoding, Universal Turing Machine 22,23

12 Pumping lemma and non-regular language Grammars 10

13 Decidability 18

14 Context sensitive languages, grammars and linear bounded 24


automata (LBA), Chomsky’s hierarchy of grammars

15 Defining Computers by TMs. 25

15 Defining Computers by TMs. 25

Course Outline Page 4

You might also like