Notes for Theory Of Computation - TC by Verified Writer

Automata Theory, finite automata theory, Extended transition function, DFA, NFA with 6-Transition, External NFA

Regular Expression, Indentities of Regular Expression, Ardern s Theorem, Pumping Temma for Regular Expression, Minimization of DFA

Grammar, Ambiguity in Grammar, types of grammar, Usless Production, Eliminating Null Production, Removing Unit Production, Greibean Normal Form, CYA algorithm, Chomosky Classification of Grammar, Heirarchy of Grammar, Push Down Automata, Deterministic PDA, non-deterministic PDA, Pumping lemma for CFL

Turing Machine, Variness of Turing, Church Turing Hypothesis, Universal Turing Machine

Decidability Theory, Co-turing Recognizable, post correspondence problem, mapping Reducible

Odgens Law