Scribd
Upload
151 views3 pages

Course Outline - Theory of Automata

The Theory of Automata course (CS2204) for BSCS students covers fundamental models of computation, including finite automata, regular languages, and Turing machines. Students will learn to manipulate concepts in automata theory, design automata, and understand the theoretical limits of computing through various methodologies and assessments. The course runs from February 10, 2025, to June 24, 2025, and includes a mix of lectures, readings, and exams.

Uploaded by

Ibrahim Shuja
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
151 views3 pages

Course Outline - Theory of Automata

The Theory of Automata course (CS2204) for BSCS students covers fundamental models of computation, including finite automata, regular languages, and Turing machines. Students will learn to manipulate concepts in automata theory, design automata, and understand the theoretical limits of computing through various methodologies and assessments. The course runs from February 10, 2025, to June 24, 2025, and includes a mix of lectures, readings, and exams.

Uploaded by

Ibrahim Shuja
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/ 3

Course Name Theory of Automata Course 10th Feb

Course Code CS2204 Start 2025


Credit Hours 3+0
Course Prereq. Discrete Structures
Name
Course Prereq. GE1202 Course 24th
Code End June
Course Type Domain Core 2025
Program BSCS
Course Short Description
The Theory of Automata course introduces fundamental models of computation, including
finite automata, regular languages, and transition graphs. It explores non-deterministic
automata, Kleene’s theorem, and the Pumping Lemma. The course covers context-free
grammar, pushdown automata, derivation trees, parsing techniques, and Chomsky’s
hierarchy. It also delves into Turing machines, their variations, universal computation, and
the theoretical limits of computing. By studying automata and formal languages, students
gain a deep understanding of computational theory and its applications in computer
science.
CLOs - Course Learning Outcomes

Upon having completed this 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, etc. and prove properties of languages,
grammars and automata with rigorously formal mathematical methods. (C2 – Understanding)
2. Design the automata, RE and CFG and Transform between equivalent NFAs, DFAs and REs
(C3 – Applying)
3. Differentiate and manipulate formal descriptions of languages, automata and grammar
focusing on regular and context-free languages, finite automata and RE. (C3 – Applying)
4. Define Turing machines performing simple tasks with their help. (C2 – Understanding)

Teaching & Learning Methodology


1. Class lectures and demonstrations.

Textbook(s)
An Introduction to Formal Languages and Automata, by Peter Linz, Latest edition, Jones
& Bartlett Publishers.
Reference Book(s) & Reading Material
1. Introduction to Computer Theory, Daniel I. A. Cohen, Latest Edition
2. Automata, Computability and Complexity: Theory and Applications, by Elaine
Rich, 2011

Grading Policy
Assessment Instruments Percentage
Quizzes (Best n-1) 15%
Assignments 15%
Class Participation 5%
Mid Term Exam 25%
Final Exam 40%
CLO to PLO Mapping
PLO2 PLO3
CLO1 √
CLO2 √
CLO3 √
CLO4 √

Weekly Course Schedule (Tentative)


Session Topics Activities & Deliverables

Introduction to Theory of Automata


• Why Study ToA and FL?
• What is Theory of Automata
1 Readings: Textbook: Chapter 1.
• Types of Languages
• Introduction to Grammar and Alphabets
• Review of the Basic concepts

Definition of Formal Languages


• Defining Formal Languages – Description
2 Definition Readings: Textbook: Chapter 1
• Recursive Definition
• Regular Expressions

Regular Expressions
3 • Introduction to Regular Expressions Readings: Textbook: Chapter 3.
• Equivalent Regular Expressions
• Regular Languages

Finite Automata
• Introduction to Finite Automata
• Transition Table
4 • Transition Diagram
Readings: Textbook: Chapter 2.
• Limitation of FA

Transition Graphs
• Introduction
5 Readings: Textbook: Chapter 2.
• Finite Automata to Transition Graphs
• Discussion on Transition Graphs

Kleene’s Theorem
• Property of Transitivity
6 • Proof of Strategies Readings: Textbook: Chapter 3 & 4.
• Uniqueness and Concatenation
• Understanding Rules

Non-Deterministic Finite Automata


• Introduction to NFA
7 • Resolving the Conflict Readings: Textbook: Chapter 2 & 4.
• Designing NFA
• NFA to DFA

Midterm Assessments
Moore and Mealy Machine
8 • Designing the Moore Machine Readings: Textbook: Appendix.
• Designing the Mealy Machine
• Equivalent Machines

Regular and Non-Regular Languages.


• Introduction to Regular Languages
9 • Introduction to Non-Regular Languages Readings: Textbook: Chapter 4 & 8.
• The Pigeonhole Principle
• The Pumping Lemma

The Context Free Grammar (CFG)


• Introduction to CFGs
10 Readings: Textbook: Chapter 5.
• Context-Free Languages
• Constructing the CFG

Syntax and Structural Representation


• Parse Trees
11 • Polish Notation Readings: Textbook: Chapter 6.
• Total-Language Trees
• Ambiguous Grammar

Grammar Transformations: Regular and


Context-Free
12 • Regular Grammar Readings: Textbook: Chapter 6 & 7.
• Simplification of CFG
• Normal Forms of CFG

The Push-Down Automata (PDA)


• Introduction
• Constructing the PDA
13 Readings: Textbook: Chapter 7.
• Non-Deterministic PDA
• CFG relation with PDA

Higher-Order Grammars
• Context Sensitive Grammar,
14 Readings: Textbook: Chapter 11.
• Context Sensitive Languages
• Type 0 Grammar

Turing Machine (TM)


• Definition of Turing Machine
15 • TM as a Language Acceptor Readings: Textbook: Chapter 9 & 10.
• TM as a Transducer
• Variants of TM

Final Exam

You might also like