CS 311:Automata and Complexity Theory
Winter 2002-2003
AUTOMATA AND COMPLEXITY THEORY (CS 311)
Course Outline
Instructor: Humaira Kamal
Year:
2002-2003
Office:
Room 230
Quarter:
Winter
Email:
[email protected]
Category:
Junior
Extension: 2230
Office Hours: TBA
TAs for the Course: TBA
_____________________________________________________________________________
Course:
Description:
CS 311: Automata and Complexity Theory (4 units)
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 non-deterministic) and pushdown automata. They shall
also learn about fundamental concepts of Turing machines.
Core/Elective:
Elective
Pre-requisites:
Discrete Mathematics (CS 211)
Text:
Peter Linz, ‘An Introduction to Formal Languages and Automata', 1990.
Some handouts may be given to supplement the text.
Reference:
Daniel I. A. Cohen, ‘Introduction to Computer Theory', 2nd Edition, 1997,
John Wiley & Sons, Inc.
Lectures:
There shall be 30 sessions
o 20 of 75 minutes each
o 10 of 50 minutes each
1
CS 311:Automata and Complexity Theory
Winter 2002-2003
Grading:
o
o
o
30% Quizzes / Assignments
35% Midterm Exam
35% Final Exam
Topics
Sessions
Readings
Introduction to the Theory of Computation
1.5
Chapter 1
Finite Automata (Deterministic Finite Accepters, Nondeterministic Finite Accepters, Equivalence of DFA
and NFA etc.)
4.5
Chapter 2
Regular Languages and Regular Grammars (Regular
Expressions, Connection between Regular Expressions
& Regular Languages, Regular Grammars etc.)
3
Chapter 3
Properties of Regular Languages
3
Chapter 4
Context Free Languages (Context Free Grammars,
Left and Right Most Derivations, Derivation Trees and
Sentential Forms)
3
Chapter 5
MIDTERM
1
Simplification of Context Free Grammars and
Normal Forms
3.5
Chapter 6
Pushdown Automata (Non-deterministic Pushdown
Automata, Pushdown Automata and Context Free
Languages, Deterministic Pushdown Automata.)
4.5
Chapter 7
2
CS 311:Automata and Complexity Theory
Winter 2002-2003
Turing Machines (Turing Machines as Language
Accepters, Turing Machines as Language Transducers,
etc.)
4
Chapter 9
Recursive and Recursively Enumerable Languages
2
Chapter 11
FINAL EXAM
3