Formal Languages and Automata Theory (FLAT) Notes

PART I: Finite Automata and Regular Languages
* Lecture 1. Introduction
* Lecture 2. Deterministic Finite Automata (DFAs)
* Lecture 3. Nondeterministic Finite Automata (NFAs)
* Lecture 4. Patterns, regular expressions and Finite Automata
* Lecture 5. Klenee algebras and regular expressions (will be updated)
* Lecture 6. Homomorphisms
* Lecture 7. Limitations of Finiter Automata
* Lecture 8. DFA state minimization
* Lecture 10 The Myhill-Nerode Theorem

PART II: Pushdown Automata and Context-Free Langugaes
* Context-Free Grammars and Langugaes(will be updated)
* Linear Grammars and Normal Forms
* Pushdown Automata and CFGs
* Parse Trees and Parsing
* The Pumping lamma and properties of CFLs

PART III: Turing machines and Effective Computability
* Turing Machines and the Church-Turing thesis
* Other equivalent models of Turing machines
* Universal Turing machine and the Halting Problem
* Problem reduction and Other Undecidable Problems

The below link contains the above chapters in PPT'S
You can get some materials from the below link also

OR files).ra


Post a Comment


Student Steps - To Success Copyright 2011 is Designed by Pavan Kumar