CMSACOR12T: Theory of Computation Theory: 75 Lectures AdditionalTutorial: 15 Lectures
1. Languages
(10 Lectures)
Alphabets, string, language, Basic Operations on language, Concatenation, Kleene Star 2. Finite Automata and Regular Languages (25 Lectures) Regular Expressions, Transition Graphs, Deterministics and non-deterministic finite automata, NFA to DFA Conversion, Regular languages and their relationship with finite automata, Pumping lemma and closure properties of regular languages. 3. Context free languages (20 Lectures) Context free grammars, parse trees, ambiguities in grammars and languages, Pushdown automata (Deterministic and Non-deterministic), Pumping Lemma, Properties of context free languages, normal forms. 4. Turing Machines and Models of Computations (20 Lectures) RAM, Turing Machine as a model of computation, Universal Turing Machine, Language acceptability, decidability, halting problem, Recursively enumerable and recursive languages, unsolvability problems.
1. Languages
(10 Lectures)
Alphabets, string, language, Basic Operations on language, Concatenation, Kleene Star 2. Finite Automata and Regular Languages (25 Lectures) Regular Expressions, Transition Graphs, Deterministics and non-deterministic finite automata, NFA to DFA Conversion, Regular languages and their relationship with finite automata, Pumping lemma and closure properties of regular languages. 3. Context free languages (20 Lectures) Context free grammars, parse trees, ambiguities in grammars and languages, Pushdown automata (Deterministic and Non-deterministic), Pumping Lemma, Properties of context free languages, normal forms. 4. Turing Machines and Models of Computations (20 Lectures) RAM, Turing Machine as a model of computation, Universal Turing Machine, Language acceptability, decidability, halting problem, Recursively enumerable and recursive languages, unsolvability problems.
No comments:
Post a Comment