S.No | Title | Viewer Link |
---|---|---|

1 | Introduction on theory of computation | Click To Watch Video |

2 | Kleene closure and Kleene Plus in theory of computation | Click To Watch Video |

3 | Introduction on finite automata | Click To Watch Video |

4 | Construct DFA over alphabets {a,b} for Language L consists strings whose length is exactly '2'. | Click To Watch Video |

5 | Construct DFA over alphabet {a,b} for Language L consists strings whose length is at least '2'. | Click To Watch Video |

6 | Construct DFA over alphabets {a,b} for Language L consists strings whose length is at most '2'. | Click To Watch Video |

7 | Construct a DFA over alphabets {a,b} for Language L consists strings start with 'b'. | Click To Watch Video |

8 | Minimal DFA for alphabets {a,b} for Language L have strings starts with a Sub string. | Click To Watch Video |

9 | Construct a DFA over alphabets {a,b} for Language L consists strings ends with an alphabet 'b'. | Click To Watch Video |

10 | Minimal DFA for alphabets {a,b} for Language L have strings ends with a sub string. | Click To Watch Video |

11 | DFA over alphabet {a,b} for Language L consists strings ends with a sub string 'ab'. | Click To Watch Video |

12 | Construct a DFA over alphabets {a,b} for Language L having strings contains an alphabet 'b'. | Click To Watch Video |

13 | Minimal DFA for alphabets {a,b} for Language L have strings contains a sub string. | Click To Watch Video |

14 | Construct a DFA over alphabets {a,b} for Language L contains strings of EVEN length. | Click To Watch Video |

15 | Construct a DFA over alphabets {a,b} for Language L contains strings of ODD length. | Click To Watch Video |

16 | DFA over alphabets {a,b} for Language L contains strings whose length is divisible by 4. | Click To Watch Video |

17 | DFA for alphabets {a,b} Language have strings whose length is divide by 4 then remainder is 1. | Click To Watch Video |

18 | Construct a minimal DFA over alphabets {a,b} for Language L have strings contains two a's. | Click To Watch Video |

19 | Construct a DFA over alphabets {a,b} for Language L contains strings where at least two a's. | Click To Watch Video |

20 | Construct a DFA over alphabets {a,b} for Language L contains strings where at most two a's. | Click To Watch Video |

21 | DFA over alphabets {a,b} for Language L have strings where no of a's can be divide by 3. | Click To Watch Video |

22 | DFA over alphabets {a,b} for Language L have strings contains even no of a's and b's. | Click To Watch Video |

23 | DFA for alphabets {a,b} for Language L have strings where every a should not follow by b | Click To Watch Video |

24 | DFA for alphabets {a,b} for Language L have strings starts and ends with different symbol. | Click To Watch Video |

25 | DFA for alphabets {a,b} for Language L have strings starts and ends with same symbol. | Click To Watch Video |

26 | Construct a minimal DFA for alphabets {a,b} for Language L have strings of form 0^m 1^n | Click To Watch Video |

27 | Minimal DFA for alphabets {0, 1} for Language L have strings 2nd symbol from L.H.S be 1 | Click To Watch Video |

28 | Steps in DFA minimization | Click To Watch Video |

29 | Example 1 on DFA minimization | Click To Watch Video |

30 | Complement of DFA in theory of computation | Click To Watch Video |

31 | Reversal of a language and DFA | Click To Watch Video |

32 | Introduction on NFA in TOC | Click To Watch Video |

33 | Examples on NFA | Click To Watch Video |

34 | Part 2: Examples on NFA | Click To Watch Video |

35 | Steps in conversion of NFA to DFA in TOC | Click To Watch Video |

36 | Example 1 on converting NFA to DFA | Click To Watch Video |

37 | Example 2 on NFA to DFA conversion in TOC | Click To Watch Video |

38 | NFA over {0,1} for language consists of strings where second symbol from R.H.S is 1. | Click To Watch Video |

39 | Introduction on epsilon NFA in TOC | Click To Watch Video |

40 | Examples on constructing epsilon NFA in TOC | Click To Watch Video |

41 | Epsilon-closure of a epsilon NFA | Click To Watch Video |

42 | Steps in epsilon NFA to NFA conversion | Click To Watch Video |

43 | Example 1 on epsilon NFA to NFA conversion | Click To Watch Video |

44 | Example 2 on epsilon NFA to NFA conversion | Click To Watch Video |

45 | Introduction on Moore machine | Click To Watch Video |

46 | Example 1 on Constructing Moore machine which counts occurrence of a sub string. | Click To Watch Video |

47 | Moore machine for computing 1's complement of a binary number | Click To Watch Video |

48 | Moore machine for computing 2's complement of a binary number. | Click To Watch Video |

49 | Introduction on mealy machine in TOC | Click To Watch Video |

50 | Construct a mealy machine to compute the occurrence of a sub string. | Click To Watch Video |

51 | Mealy machines for computing 2's complement of a binary number. | Click To Watch Video |

52 | Example on Moore machine to Mealy machine conversion in TOC. | Click To Watch Video |

53 | Example 1 on conversion of Mealy to Moore machine | Click To Watch Video |

54 | Example 2 on conversion of Mealy machine to Moore machine in TOC. | Click To Watch Video |

55 | Pumping lemma for regular languages in TOC | Click To Watch Video |

56 | Example 1 on Pumping lemma for regular language in TOC. | Click To Watch Video |

57 | Examples on Regular language or not in TOC | Click To Watch Video |

58 | Introduction on Grammar in TOC | Click To Watch Video |

59 | Chomsky classification on grammars in TOC | Click To Watch Video |

60 | Relation between grammar, language, and model in TOC | Click To Watch Video |

61 | Introduction on Regular expressions in TOC | Click To Watch Video |

62 | Examples on Conversion of Regular expression to language | Click To Watch Video |

63 | Important questions on Regular expressions | Click To Watch Video |

64 | Examples on conversion of a language to regular expression. | Click To Watch Video |

65 | Examples 2 for finding Regular expression for a language | Click To Watch Video |

66 | Steps in Converting Finite Automata to Regular Expressions In TOC. | Click To Watch Video |

67 | Examples on Converting Finite Automata to Regular Expressions In TOC. | Click To Watch Video |

68 | Examples on converting regular expression to finite automata | Click To Watch Video |

69 | Conversion of Regular expression to Grammar | Click To Watch Video |

70 | Part 2: Conversion of Regular expression to grammar in TOC | Click To Watch Video |

71 | Introduction on Push down Automata | Click To Watch Video |

72 | Representation of Push Down Automata | Click To Watch Video |

73 | Example 1 on constructing a Push Down Automata for Context free languages | Click To Watch Video |

74 | Example 2 on constructing a Deterministic Push Down Automata for Context free language in TOC. | Click To Watch Video |

75 | Example 3 on Constructing deterministic Push Down automata in TOC | Click To Watch Video |

76 | Example 4 on Constructing deterministic Push Down automata in TOC | Click To Watch Video |

77 | Example 5 on construction of Deterministic Push Down Automata in TOC | Click To Watch Video |

78 | Example on construction of Non deterministic push down automata | Click To Watch Video |

79 | Introduction on Simplification of Context Free Grammar | Click To Watch Video |

80 | Examples on Eliminating Epsilon (Null) Productions from Context Free Grammar in TOC | Click To Watch Video |

81 | Eliminating Unit Productions In Context Free Grammar | Click To Watch Video |

82 | Steps in eliminating useless productions in Context Free Grammar | Click To Watch Video |

83 | Examples on eliminating useless productions in CFG | Click To Watch Video |

84 | Introduction On Chomsky Normal Form | Click To Watch Video |

85 | Steps in Converting Context free grammar to Chomsky Normal Form | Click To Watch Video |

86 | Example 1 on Conversion of Context Free Grammar to Chomsky Normal Form | Click To Watch Video |

87 | Example 2 Context Free Grammar to Chomsky Normal Form conversion | Click To Watch Video |

88 | Introduction on Greibach Normal Form in TOC | Click To Watch Video |

89 | Steps in converting context free grammar to greibach normal form | Click To Watch Video |

90 | Context free grammar to Greibach normal form conversion | Click To Watch Video |

91 | Pumping Lemma for Context free Languge in TOC | Click To Watch Video |

92 | Example on Pumping lemma for context free language | Click To Watch Video |

93 | Introduction on Turning machine in TOC | Click To Watch Video |

94 | Formal definition of a Turing Machine | Click To Watch Video |

95 | Turing machine for a ^n b ^ n where n is grater than or equal to 1. | Click To Watch Video |

96 | Turing machine for a ^ n b ^ n c ^ n, n is greater than equal to 1 | Click To Watch Video |

97 | Turning Machine for W C W where W belongs to (a,b) ^ * | Click To Watch Video |

98 | Turing Machine for W W ^ R where W belongs to ( a, b) ^ * | Click To Watch Video |

99 | Turing machine for computing 2 ' s complement of a binary number | Click To Watch Video |

100 | Turing machine for unary addition | Click To Watch Video |

101 | Turing machine for multiplication | Click To Watch Video |

102 | Turing machine for Division | Click To Watch Video |

103 | Turing machine for Unary to Binary conversion | Click To Watch Video |

104 | Linear Bounded Automata for context sensitive language | Click To Watch Video |

105 | Linear bounded automata for a ^ n b ^ n c ^ n where n is greater than or equal to 1. | Click To Watch Video |

106 | Turing Thesis | Click To Watch Video |

107 | Modifications to Standard Turing Machine | Click To Watch Video |

108 | Non halting Turing Machine | Click To Watch Video |

109 | Recursively enumerable language and Recursive language | Click To Watch Video |

110 | Universal Turing Machine | Click To Watch Video |

111 | Decidable and Undecidable problem | Click To Watch Video |

112 | P and NP Class problem | Click To Watch Video |

113 | NP Hard and NP Complete problems | Click To Watch Video |

114 | Closure properties of Regular language | Click To Watch Video |

Login to see solution/discussion