Theory of Computation (TOC)
AD-501-
Unit 1Introduction of Automata Theory
Review of Sets · Mathematical formal proofs including proof by induction and by contradiction · Introduction to languages, grammars and automata: Alphabet · Representation of language and grammar · Types of Automata · Finite Automata as a language acceptor and translator · Moore machines and Mealy machines · Composite machine · Conversion from Mealy to Moore and vice versa
-
Unit 2Types of Finite Automata
Non Deterministic Finite Automata (NDFA) · Deterministic finite automata machines · Conversion of NDFA to DFA · Minimization of automata machines · Regular expression · Applications of regular expressions · Arden’s theorem · Meaning of union, intersection, concatenation and closure · 2‑way DFA
-
Unit 3Grammars
Types of grammar · Context sensitive grammar · Context free grammar · Regular grammar · Derivation trees · Ambiguity in grammar · Simplification of context free grammar · Conversion of grammar to automata machine and vice versa · Chomsky hierarchy of grammar · Chomsky normal form and Greibach normal form
-
Unit 4Push down Automata
Example of PDA · Deterministic and non‑deterministic PDAs · Context Free Grammar · Parsing · Ambiguity · Normal form of CFGs · CFG to NPDA · NPDA to CFGs · CFG equivalent to PDA · Petri nets model
-
Unit 5Turing Machine
Turing Machine as acceptor · Recognizing a Language · Universal TMs · Linear Bounded Automata · Context Sensitive Languages · Recursive and Recursively Enumerable Languages · Unrestricted Grammars · Halting problem of Turing machine & the post correspondence problem · Concept of Solvability and Unsolvability · Church’s Thesis · Complexity Theory – P and NP problems