PowerPoint Lectures
Theory of AutoMata
| ||
| Course Outline | ||
| Lec-0 Automata and Complexity Theory | ||
| Lec-1 Mathematical and Preliminaries | ||
| Lec-2 Finite Automata | ||
| Lec-3, Non Deterministic Automata | ||
| Lec-4 ,Single Final State of NFAs | ||
| Lec-5 ,Grammars in Automata | ||
| Lec-6, Regular Languages Automata | ||
| Lec-7 The Pumping Lemma Automata | ||
| Lec-8,9 Equivalance and Minimization of Automata | ||
| Lec-10 Automata, Context Free Languages | ||
| Lec-11 Pushdown Automata PDA's | ||
| Lec-12.13 NPDAs Accept Context Free Language | ||
| Lec-14 Simplification of Context Free Languages Automata | ||
| Lec-15 Positive Properies of Context Free Languages | ||
| Lec-16 Automata | ||
| Lec-17 Turning Machines | ||
| Lec-18 Turning Thesis | ||
| Lec-19 Automata | ||
| Lec-20 Recursively Enumerable and Recursive Languages | ||
| Lec-1 | ||
| Lec-1 | ||
| Automata on Guarded Strings and Applications | ||
| Finite Automata | ||
| ambek Calculus Proofs and Tree Automata |
| |
0 comments:
Post a Comment