FLAT LECTURE PLAN
Course Code & Name
: 080230020/ Formal Languages and Automata Theory
Faculty :
Class & Semester : III Year BE (CSE) – V Semester
Sl. No.
|
PROPOSED
|
TOPIC
|
|
DATE
|
PERIOD |
||
1
|
18.6.12
|
4
|
Module I : Introduction
|
2
|
18.6.12
|
7
|
Mathematical preliminaries and notations (Tutorial-1)
|
3
|
19.6.12
|
1
|
Continue
|
4
|
20.6.12
|
3
|
Central concepts of automata theory
|
5
|
22.6.12
|
6
|
Finite
automata
|
6
|
25.6.12
|
4
|
Continue
|
7
|
25.6.12
|
7
|
Tutorial 2
|
8
|
26.6.12
|
1
|
Deterministic Finite Automata
|
9
|
27.6.12
|
3
|
Nondeterministic Finite Automata
|
10
|
29.6.12
|
6
|
Continue
|
11
|
02.7.12
|
4
|
Equivalence of DFA and NFA
|
12
|
02.7.12
|
7
|
Tutorial
3
|
13
|
03.7.12
|
1
|
Finite Automata with Epsilon transitions
|
14
|
04.7.12
|
3
|
Application of FA
|
15
|
06.7.12
|
6
|
Revision
|
16
|
09.7.12
|
4
|
Module II:
Regular languages introduction
|
17
|
09.7.12
|
7
|
Tutorial 4
|
18
|
10.7.12
|
1
|
Regular languages
|
19
|
11.7.12
|
3
|
continue
|
20
|
13.7.12
|
6
|
Regular Expressions
|
21
|
16.7.12
|
4
|
Finite Automata and Regular Expressions
|
22
|
16.7.12
|
7
|
Tutorial 5
|
23
|
17.7.12
|
1
|
Continue
|
24
|
18.7.12
|
3
|
Applications of Regular Expressions
|
CYCLE TEST -1
|
|||
25
|
23.7.12
|
4
|
Continue of applications
|
26
|
23.7.12
|
7
|
Tutorial 6
|
27
|
24.7.12
|
1
|
Regular Grammars
|
28
|
25.7.12
|
3
|
continue
|
29
|
27.7.12
|
6
|
Revision
|
30
|
30.7.12
|
4
|
Module III: Properties
of regular languages:
|
31
|
30.7.12
|
7
|
Tutorial 7
|
32
|
31.7.12
|
1
|
Pumping lemma for regular languages
|
33
|
01.8.12
|
3
|
continue
|
34
|
03.8.12
|
6
|
Closure properties of regular languages
|
35
|
06.8.12
|
4
|
continue
|
36
|
06.8.12
|
7
|
Tutorial 8
|
37
|
07.8.12
|
1
|
Decision properties of Regular languages
|
38
|
08.8.12
|
3
|
|
39
|
10.8.12
|
6
|
Equivalence and Minimization of Finite Automata
|
40
|
13.8.12
|
4
|
continue
|
41
|
13.8.12
|
7
|
Tutorial 9
|
42
|
14.8.12
|
1
|
Revision
|
43
|
17.8.12
|
6
|
Module IV:
Context Free languages
|
44
|
22.8.12
|
3
|
Context Free Grammars - Parse Trees
|
CYCLE TEST
-2
|
|||
45
|
27.8.12
|
4
|
Ambiguity in Grammars and languages
|
46
|
27.8.12
|
7
|
Tutorial 10
|
47
|
28.8.12
|
1
|
Applications of Context Free Grammars
|
48
|
29.8.12
|
3
|
Pushdown automata (PDA)
|
49
|
31.8.12
|
6
|
|
50
|
03.9.12
|
4
|
Languages of a PDA
|
51
|
03.9.12
|
7
|
Tutorial 11
|
52
|
04.9.12
|
1
|
Equivalence of PDA’s and CFG’s
|
53
|
05.9.12
|
3
|
|
54
|
07.9.12
|
6
|
Revision
|
55
|
10.9.12
|
4
|
Module V:
Properties of Context Free Languages
|
56
|
10.9.12
|
7
|
Tutorial 12
|
57
|
11.9.12
|
1
|
Normal Forms(CNF,GNF) for Context Free Grammars
|
58
|
12.9.12
|
3
|
continue
|
59
|
14.9.12
|
6
|
Pumping lemma for CFL’s
|
60
|
17.9.12
|
4
|
|
61
|
17.9.12
|
7
|
Tutorial 13
|
62
|
18.9.12
|
1
|
Closure properties of CFL
|
63
|
21.9.12
|
6
|
Decision properties of CFL’s
|
64
|
24.9.12
|
4
|
|
65
|
24.9.12
|
7
|
Tutorial 14
|
66
|
25.9.12
|
1
|
Revision
|
Faculty in- charge HOD/CSE
PRINCIPAL
No comments:
Post a Comment