Back

Video Tutorials

Slides

Links

Theory of Computing

Review of mathematical background in automata
Finite automata
Deterministic Finite automata
Non-deterministic Finite automata
Regular expressions and Regular sets
Pumping lemma, closure properties
Kleene’s Theorem
Regular grammars
Context Free grammar and languages
Useful symbols, productions, unit productions in Forms
Chomsky normal form
Push-down automata
Equivalence between push-down automata and context-free languages
Introduction to Turing machines : 1
Introduction to Turing machines : 2