SCHOOL OF COMPUTER ENGINEERING

CS-3003
Formal Language and Automata Theory
Lecture: 3 Hrs/Week Internal Assessment Marks: 50

Tutorial: 1 Hrs/Week End Term Marks: 50

Practical: 0 Credits: 4
Topics / Coverage Lecture S N

Introduction to Formal languages, preliminaries and over 2nd july

view of syllabus
Strings, Alphabet, Language, Operations on languages, 3rd july
Inductive Proofs, Relations and Functions.
Description and definition of DFA with examples lec-1 5th july
DFA with examples lec-2 9th july
DFA with examples lec-3 10th july
Languages accepted by DFAs 11th july
Design of complex DFAs 12th july
1.Tutorial 16th july
Description and definition of NFA lec-1 17th july
NFA lec-2 18th july
Languages accepted by NFAs 19th july
NFA with -transitions. 23rd july
2.Tutorial 24th july
Conversion from NFA to DFA 25th july
More examples on conversion 26th july
Reduction of number of states in FA 30th july
More examples on reduction 31st july
3.Tutorial 1st aug
Description of regular expression. 2nd aug
Equivalence of FA & RE 6th aug
Finding a Regular expression from a DFA(minimization) 7th aug
Conversion from regular expression to DFA 8th aug
4.Tutorial 9th aug
Closure properties of regular language lec-1 13th aug
Closure properties of regular language lec-2 14th aug
Pumping lemma for regular grammar. 16th aug
Proof a language is regular or not 20th aug
5.Tutorial-1(pre-mid semester questions discussion) 21st aug
6. Tutorial-2(pre-mid semester questions discussion) 22nd aug
Description of Regular grammars with examples lec-1 4th sep
Regular grammar lec-2 5th sep
Regular grammar to DFA conversion LEC-1 6th sep
Regular grammar to DFA conversion LEC-2 10th sep
6.Tutorial 11th sep
Context free languages & derivation trees lec-1 12th sep
Context free languages & derivation trees lec-2 13th sep
Context free languages & derivation trees lec-3 17th sep
Parsing and ambiguity 18th sep
More examples on parsing and ambiguity 19th sep
7.Tutorial 20th sep
Simplification of CFG lec-1 24th sep
a) Useless symbol removal
b) Removal of λ- production.
c) Removal of unit production
More examples of CFG 25th sep
CNF with examples lec-1 26th sep
CNF with examples lec-2 27th oct
Description of GNF with examples lec-1 1st oct
Description of GNF with examples lec-2 3rd oct
8.Tutorial 4th oct
Pumping lemma theorem for CFL with examples lec-1 15th oct
Pumping lemma theorem for CFL with examples lec-2 16th oct
Properties of CFG with proof lec-1 17th oct
Properties of CFG with proof lec-2 18th oct
9.Tutorial 22nd oct
Chomsky classification of grammar & Languages. 23rd oct
Introduction to PDA with examples lec-1 24th oct
PDA lec-2 25th oct
PDA lec-3 29th oct
Equivalence of PDA & CFA lec-1 30th oct
Equivalence of PDA & CFA lec-2 31st oct
10.Tutorial 1st nov
Turing Machine lec-1 5th nov
Turing Machine lec-2 6th nov
Turing Machine lec-3 7th nov
11. Tutorial 8th nov
Previous year question discussion-1 13th nov
Previous year question discussion-2 14th nov
Previous year question discussion-3 15th nov
Previous year question discussion-4 19th nov