Notes for Theory Of Computation - TC by Verified Writer

Alphabet, languages and grammars Production rules and derivation of languages Chomsky hierarchy of languages Regular grammars, regular expressions and finite automata deterministic and nondeterministic Closure and decision properties of regular sets Pumping lemma of regular sets Minimization of finite automata Left and right linear grammars

Context free grammars and pushdown automata Chomsky and Griebach normal forms Parse trees, Cook, Younger, Kasami, and Early s parsing algorithms Ambiguity and properties of context free languages Pumping lemma, Ogden s lemma, Parikh s theorem Deterministic pushdown automata, closure properties of deterministic context free languages

Turing machines and variation of Turing machine model, Turing computability , Type 0 languages Linear bounded automata and context sensitive languages Primitive recursive functions Cantor and Godel numbering Ackermann s function, mu- recursive functions, recursiveness of Ackermann and Turing computable functions Church Turing hypothesis Recursive and recursively enumerable sets

Turing machine and undecidable problems Undecidability of Post correspondence problem Valid and invalid computations of Turing machines and some undecidable properties of context free language problems Time complexity class P, class NP, NP completeness