12/4/24, 7:33 PM A complete web enabled Education Administration Software

A complete web enabled Education Administration

1 Introduction, Background on Sets, Relations and Graphs

2 Background on different types of mathematical proofs: Deductive, Contradiction, Induction, and Contra positive

3 Formal Definition of Deterministic Finite Automata (DFA)

4 State transition diagram, Examples of languages accepted by DFA

5 Problem solving on DFA

6 Non-Deterministic Finite Automata(NFA): Formal definition

7 Examples of languages accepted by NFA

8 Problem solving on NFA

9 Minimization of DFA and Myhill Nerode theorem

10 Problem solving on Minimization of DFA

11 Empty moves, conversion of NFA with empty moves into NFA without empty moves

12 Conversion of NFA without empty moves into DFA

13 Finite Automata with outputs (Mealy machine and Moore Machine)

14 Problem solving on Mealy machine and Moore Machine

15 Inter conversion between Mealy machine and Moore machine

16 Introduction to Regular Expressions (RE), Properties of RE

17 Problem solving on RE

18 DFA to RE and RE to DFA

19 Closure Properties of Regular Languages (RL)

20 Pumping lemma for RL

21 Problem solving on pumping lemma for RL

22 Introduction to Grammar and its four tuples

23 Introduction to Context Free Grammar (CFG) and Problem solving on generating language from given grammar.

24 Numerical on creation of grammar for the given language

25 Derivation and Derivation Tree

26 Left most derivation and Right Most Derivation

27 Discussion on Ambiguity and removal of ambiguity

about:blank 1/2
12/4/24, 7:33 PM A complete web enabled Education Administration Software

Sr.
No. Topic Name

28 Elimination of epsilon moves, Removal of useless production, removal of unit production and removal of left recursion
from grammar

29 Numerical on Elimination of epsilon moves, Removal of useless production and removal of unit production

30 Conversion of the grammar into Chomsky Normal Form (CNF)

31 Conversion of the grammar into Greibach Normal Form (GNF)

32 Introduction to Pushdown automata (PDA) and its type (Deterministic PDA (DPDA) and Non-deterministic PDA(NPDA))

33 Numerical on NPDA and DPDA

34 Numerical on NPDA and DPDA and introduction to 2-PDA

35 PDA to CFG

36 CFG to PDA

37 Properties of Context Free Languages (CFL)

38 Pumping lemma for CFL

39 Chomsky hierarchy of languages (Focusing on Regular Languages, Context Sensitive Languages)

40 Turing Machine and its variants (Like Linear Bounded Automata and Universal Turing Machine)

41 Numerical on Turing Machine

42 Halting problem and introduction to Undecidability

43 Recursive (REC) Languagesand Recursive Enumerable (RE) Languages

44 Post Correspondence Problem (PCP)

about:blank 2/2