| 13-3-2023 |
1.5 hours |
Introduction to Theory of automata and Course Description |
|
|
|
1.5 hours |
Under standing of Languages, |
|
|
| 20-3-2023 |
1.5 hours |
Kleene Star, Descriptive and Recursive of Languages |
|
|
|
1.5 hours |
Recursive Definition & Theorems |
|
|
| 27-3-2023 |
1.5 hours |
Regular Languages and Regular Expression |
Assignment |
|
|
1.5 hours |
Regular Languages |
|
|
| 3-4-2023 |
1.5 hours |
Regular expressions |
Quiz |
|
|
1.5 hours |
Regular expressions |
|
|
| 10-4-2023 |
1.5 hours |
Finite Automata |
|
|
|
1.5 hours |
Transition Graphs practice examples |
Assignment |
|
| 17-4-2023 |
1.5 hours |
Types of Finite automata (DFA, NFA) |
|
|
|
1.5 hours |
NFA to DFA practice examples |
Quiz |
|
| 24-4-2023 |
1.5 hours |
Conversion NFA to DFA |
|
|
|
1.5 hours |
Moore and Mealy Machines |
|
|
| 1-5-2023 |
1 Hour |
Mid Term |
|
|
| 8-5-2023 |
1.5 hours |
Push Down automata |
|
|
|
1.5 hours |
Push Down Automata practice examples |
|
|
| 15-5-2023 |
1.5 hours |
Push Down Automata |
|
|
|
1.5 hours |
Push Down automata examples |
|
|
| 22-5-2023 |
1.5 hours |
Context Free Grammar |
|
|
|
1.5 hours |
String Parsing, Top down Bottom Up Parsing |
|
|
| 29-5-2023 |
1.5 hours |
Left Parsing , Right Parsing, |
|
|
|
1.5 hours |
Parse Tree, Types of Parse Tree, Examples, Ambiguity, Precedence |
|
|
| 5-6-2023 |
1.5 hours |
Total Tree Derivation |
|
|
|
1.5 hours |
Turing Machine |
|
|
| 12-6-2023 |
1.5 hours |
Turing Machine |
|
|
|
1.5 hours |
Turing Machine and JFLAP |
|
|
| 19-6-2023 |
1.5 hours |
Presentations/Project |
|
|
|
1.5 hours |
Presentations/Project |
|
|
| 26-6-2023 |
1.5 hours |
Revision |
|
|
|
1.5 hours |
Revision |
|
|
| 3-7-2023 |
2 Hour |
Final Term |
|
|
