Sunday 17 February 2013

FORMAL LANGUAGES AND AUTOMATA THEORY (FLAT) - CSE MATERIAL

FORMAL LANGUAGES AND AUTOMATA THEORY (FLAT) - CSE MATERIAL ::::


NOTE :::
                   HI friends this subject is very difficult your faculty to explain .But this material is very help full to your mid exams and final exams also.please prepare carefully in this subject pass percentage is 60% per sem..

\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\///////////////////////////////////////////////////////////////////////////////

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
Additional Study Materials on FLAT

0 comments:

Post a Comment