CN Amit Khurana

1: [Syllabus of TOC] Syllabus of TOC

2: [Syllabus of TOC] Syllabus of TOC

3: [Finite Automata and regular languages] Basic Terms Used in TOC

4: [Finite Automata and regular languages] Basic Terms Used in TOC

5: [Finite Automata and regular languages] Introduction to FA

6: [Finite Automata and regular languages] Construction of FA part 1

7: [Finite Automata and regular languages] Construction of FA part 2

8: [Finite Automata and regular languages] Construction of FA part 3

9: [Finite Automata and regular languages] Construction of FA part 4

10: [Finite Automata and regular languages] Construction of FA part 5 , NFA to DFA conversion

11: [Finite Automata and regular languages] Minimization of states of DFA , NFA with null move

12: [Finite Automata and regular languages] NFA with null move, Intro to Grammars

13: [Finite Automata and regular languages] chomsky hierarchy

14: [Finite Automata and regular languages] Construction of regular grammars

15: [Finite Automata and regular languages] Construction of regular grammars, Context Free Grammars

16: [Finite Automata and regular languages] Construction of Context Free Grammars

17: [Finite Automata and regular languages] Construction of Context Free Grammars and context sensitive grammars

18: [Finite Automata and regular languages] Some exceptional questions on regular languages

19: [Finite Automata and regular languages] Identifng the type of language

20: [Finite Automata and regular languages] closure properties of languges

21: [Finite Automata and regular languages] closure properties of RE and REC languges

22: [Finite Automata and regular languages] Regular Expression part 1

23: [Finite Automata and regular languages] Regular Expression part 2

24: [Finite Automata and regular languages] FA to regular Expressions (Arden's Theorem)

25: [Finite Automata and regular languages] FA to regular Expressions (State Elimination Method), R.E to FA

26: [Finite Automata and regular languages] Pumping Lemma Part 1

27: [Finite Automata and regular languages] Pumping Length

28: [Finite Automata and regular languages] Counting FA and My hill nerode theorem

29: [CFLs and PDA] Ambiguity in CFG

30: [CFLs and PDA] Reduction of CFG

31: [CFLs and PDA] Normal Forms (CNF and GNF)

32: [CFLs and PDA] Introduction to PDA part 1

33: [CFLs and PDA] Introduction to PDA part 2

34: [CFLs and PDA] Introduction to PDA part 3

35: [CFLs and PDA] PDA PYQ , Identifying DCFL

36: [CFLs and PDA] Closure properties of DCFL and some Additional Closure properties

37: [Turing machine and decidability] Introduction to Turing machines part 1

38: [Turing machine and decidability] Introduction to Turing machines part 1

39: [Turing machine and decidability] Introduction to Turing machines part 2, Church turing thesis

40: [Turing machine and decidability] Variations of TM

41: [Turing machine and decidability] Decidability part 1

42: [Turing machine and decidability] Decidability part 2

43: [Turing machine and decidability] Decidability part 3

44: [Turing machine and decidability] Decidability part 4

45: [Turing machine and decidability] Decidability part 5

46: [Turing machine and decidability] Decidability part 5(Rice Theorem)