CS402 : Theory of Automata

Course Overview

Course Synopsis

This is an introductory course on Theory of Automata. Students are introduced to the concept of Formal Language and Automata. Formal Languages cover recursive definitions of languages, regular grammar, regular expression, context free grammar and language. In Automata they learn about finite automata (deterministic; non-deterministic),transition graphs and pushdown automata (deterministic; non-deterministic). They also learn about fundamental concept of Moore and Mealy machines and Turing machines.

Course Learning Outcomes

At the end of the course, you should be able to:

  • Explain different methods for defining languages
  • Discuss what Finite Automata is
  • Differentiate between Regular Languages and NonRegular Languages
  • Describe Context-free languages and context-free grammars, parse trees, derivations and ambiguity; Basic concepts of pushdown automata
  • Explain basic definitions and relation to the notion of an algorithm or program

Course Calendar

Introduction to the course1Handouts, Cohen (1996)3-6, Chapter 2
Kleene Star Closure   Plus operation Recursive definition of languages Examples2Handouts, Cohen (1996)7-8, Chapter 3
RE Recursive definition of RE Defining languages by RE Examples3Handouts, Cohen (1996)9-9, Chapter 4
Regular expression of EVEN-EVEN language Difference between a* + b* and (a+b)* Equivalent regular expressions; sum, product and closure of regular expressions Regular languages. Introduction to finite automaton Definition of FA Transition table Transition diagram4Handouts, Cohen (1996)10-12, Chapter 4,5
Different notations of transition diagrams Examples5Handouts, Cohen (1996)13-14, Chapter 5
More Examples of Fas6Handouts, Cohen (1996)15-16, Chapter 2
FA corresponding to finite languages Transition graphs (TG)7Handouts, Cohen (1996)17-18, Chapter 5,6
Examples of TGs8Handouts, Cohen (1996)19-20, Chapter 6
Assignment No. 01
More Examples TGs Definition of Generalized Transition Graph (GTG)9Handouts, Cohen (1996)21-23, Chapter 6
Examples of GTG Nondeterminism Kleene’s theorem (part I part II, part III) Proof of Kleene’s theorem part I10Handouts, Cohen (1996)24-25, Chapter 6,7
Proof of Kleene’s theorem part II (method with different steps).   Particular examples of TGs to determine corresponding REs.11Handouts, Cohen (1996)26-29, Chapter 7
Examples of writing REs to the corresponding TGs Kleene’s theorem part III (method 1: union of FAs) Examples of FAs corresponding to simple REs Example of Kleene’s theorem part III (method 1) continued12Handouts, Cohen (1996)30-33, Chapter 7
Examples of Kleene’s theorem part III  (method 1) continued Kleene’s theorem part III  (method 2: Concatenation of FAs) Example of Kleene’s theorem part III  (method 2 : Concatenation of FAs)13Handouts, Cohen (1996)34-36, Chapter 2
Quiz No. 01
Examples of Kleene’s theorem part III (method 1) continued Kleene’s theorem part III (method 2: Concatenation of FAs) Examples of Kleene’s theorem part III(method 2:concatenation FAs) continued Kleene’s theorem part III (method 3:closure of an FA) Examples of Kleene’s theorem part III(method 3:Closure of an FA) continued14Handouts, Cohen (1996)37-39, Chapter 2
Examples of Kleene’s theorem part III (method 3) NFA Examples Converting FA to NFA Examples Applying an NFA on an example of maze.15Handouts, Cohen (1996)40-14, Chapter 2
Assignment No. 02
Applying an NFA on an example of maze continued NFA with null string, Examples Converting NFA to FA (method 1,2,3), Examples16Handouts, Cohen (1996)42-44, Chapter 2
Converting NFA to FA (method 3) Example NFA and Kleene’s theorem method 1 Examples NFA and Kleene’s theorem method 2 NFA corresponding to union of FAs Example17Handouts, Cohen (1996)45-47, Chapter 2
NFA corresponding to union of FAs Example NFA corresponding to concatenation of FAs, Examples NFA corresponding to closure of an FA Example18Handouts, Cohen (1996)48-51, Chapter 7
NFA corresponding to Closure of FA Examples Memory required to recognize a language, Example Distinguishing one string from another Example Theorem Proof19Handouts, Cohen (1996)52-53, Chapter 7
Example of previous Theorem Finite Automaton with output Moore machine Examples20Handouts, Cohen (1996)55-56, Chapter 8
Example of Moore machine Mealy machine Examples complementing machine Incrementing machine21Handouts, Cohen (1996)57-59, Chapter 8
Applications of complementing and incrementing machines Equivalent machines Moore equivalent to Mealy Proof Example Mealy equivalent to Moore, proof Example22Handouts, Cohen (1996)60-62, Chapter 8
Mid Term Examination
Mealy machines in terms of sequential circuit23Handouts, Cohen (1996)63-64, Chapter 8
Regular languages Complement of a language Theorem Proof Example Intersection of two regular languages24Handouts, Cohen (1996)65-67, Chapter 9
Intersection of two regular languages Examples Non regular language Example25Handouts, Cohen (1996)68-71, Chapter 9,10
Example of nonregular language Pumping lemma version I, proof Examples26Handouts, Cohen (1996)72-74, Chapter 10
Pumping lemma version II Proof Examples Myhill Nerode theorem, Examples27Handouts, Cohen (1996)75-76, Chapter 10
Assignment No. 3
Examples of Myhill Nerode theorem Quotient of a language, Examples Pseudo theorem: Quotient of a language is regular Prefixes of a language Example28Handouts, Cohen (1996)77-78, Chapter 10
Example of prefixes of a language Theorem: pref(Q in R) is regular Proof Example Decidability Deciding whether two languages are regular or not? Method 1, Example Method 2, Example29Handouts, Cohen (1996)79-82, Chapter 10,11
Deciding whether two languages are equivalent or not Example Deciding whether an FA accept any string or not Method 3 Examples Finiteness of a language30Handouts, Cohen (1996)83-86, Chapter 11,12
Context Free Grammar Terminals Non-terminals Productions CFG context Free language Examples31Handouts, Cohen (1996)87-92, Chapter 12
Examples of CFLs Parsing tree Example32Handouts, Cohen (1996)90-92, Chapter 12
Example of trees Polish Notation Examples Ambiguous CFG Example33Handouts, Cohen (1996)93-95, Chapter 2
Example of Ambiguous Grammar Example of Unambiguous Grammar (PALINDROME) Total Language tree Examples, (Finite and infinite trees) Regular Grammar FA to CFG Semi word and Word Theorem Defining Regular Grammar Method to build TG for Regular Grammar.34Handouts, Cohen (1996)96-98, Chapter 12,13
Examples of building TG’s corresponding to the Regular Grammar Null productions with examples Nullable productions with examples Unit production with example Definition of Chomsky Normal Form (CNF)35Handouts, Cohen (1996)99-101, Chapter 13
Graded Discussion Board (GDB)
Chomsky Normal Form Theorem regarding CNF Examples of converting CFG to be in CNF Example of an FA corresponding to Regular CFG Left most and Right most derivations New format of FAs36Handouts, Cohen (1996)102-104, Chapter 13,14
New format for FAs input TAPE START ACCEPT REJECT READ states Examples of New Format of FA PUSH Down STACK PUSH and POP Example of PDA37Handouts, Cohen (1996)105-108, Chapter 14
Example of PDA with table for running a string Equivalent PDA PDA for EVEN EVEN Language Non-Deterministic PDA, Example of Non-Deterministic PDA Definition of PUSH DOWN Automata Example of Non-Deterministic PDA.38Handouts, Cohen (1996)109-113, Chapter 14
PDA corresponding to CFG Examples of PDA corresponding to CFG39Handouts, Cohen (1996)114-117, Chapter 15
Quiz No. 02
PDA corresponding to CFG continued CFG corresponding to PDA. Theorem HERE state Definition of Conversion form Different situations of PDA to be converted into conversion form40Handouts, Cohen (1996)118-120, Chapter 15
PDA in conversion form continued Example of PDA in conversion form Joints of the machine New pictorial representation of PDA in conversion form Summary table Row sequence Row language41Handouts, Cohen (1996)121-123, Chapter 15
Row language Nonterminals defined from summary table Productions defined by rows Rules for defining productions All possible productions of CFG for row language of the example under consideration, CFG corresponding to the given PDA42Handouts, Cohen (1996)124-126, Chapter 15
Non-Context-Free-languages Live Production Dead Production Theorem self- embedded nonterminal Pumping lemma for CFLs Examples43Handouts, Cohen (1996)127-132, Chapter 16
Decidability and Parsing techniques44Handouts, Cohen (1996)133-140, Chapter 17
Turing machine Examples DELETE subprogram Example INSERT subprogram Example.45Handouts, Cohen (1996)140-144, Chapter 19
Final Term Examination
Back to Top