| Name of the Faculty : PRIYANKA SHARMA | ||
| Discipline : B.TECH | ||
| semester : V Sem | ||
| subject : FORMAL LANGUAGES AND AUTOMATA | ||
| Paper Code : PCC-CS-506 | ||
| Lesson plan duration : From July 2019 to Novemebr 2019 | ||
| work load lecture per week(in hours) : 3 lectures | ||
| Theory | ||
| Week | Lecture Day | Topic (including assignment/test) |
| 1st | 1 | Introduction to alphabets and strings. |
| 2 | Concept of language along with examples | |
| 3 | Intoduction to grammar | |
| 2nd | 4 | Various production and derivation |
| 5 | Chomsky hierarchy of languages | |
| 6 | Intoduction to regular language | |
| 3rd | 7 | Concept of finite automata |
| 8 | Deterministic finite automata | |
| 9 | Non deterministic finite automata | |
| 4th | 10 | Revision |
| 11 | Equivalence of regular expression with DFA | |
| 12 | Regular grammar, Properties of regular languages | |
| 5th | 13 | Regular grammar |
| 14 | Pumping lemma for regular languages | |
| 15 | Minimization of finite automata | |
| 6th | 16 | Context free languages and derivation |
| 17 | context free grammar | |
| 18 | Chomsky normal form | |
| 7th | 19 | Greibach normal form |
| 20 | Revision | |
| 21 | Non deterministic pushdown automata | |
| 8th | 22 | Parse trees |
| 23 | Ambiguity in context free grammar | |
| 24 | Pumping lemma for context free languages | |
| 9th | 25 | Deterministic pushdown automata |
| 26 | Closure properties of context free languages | |
| 27 | Context sensitive grammar and languages | |
| 10th | 28 | linear bounded automata and equivalence with context sensitive languages |
| 29 | Revision | |
| 30 | Basic model for turing machines | |
| 11th | 31 | Turing recognizable(Recursive enumerable) |
| 32 | Turing decidable(Recursive) | |
| 33 | Closure properties of recursive and recursive enumerable | |
| 12th | 34 | Non deterministic turing machines |
| 35 | Deterministic turing machine | |
| 36 | Equivalence of DTM and NDTM | |
| 13th | 37 | Unrestricted grammar and equivalence with turing machines |
| 38 | Turing machine as enumerator | |
| 39 | Church turing machine | |
| 14th | 40 | Universal turing machine |
| 41 | Universqal and diagonalization language | |
| 42 | Relation between language and rice theorem | |
| 15th | 43 | Undecidable problem about languages |