07:53

093 - Gribach Normal Form (GNF) & Left Recursion [TOC by Mahesh Goyani] - CodeCrucks

11:14

092 - Conversion of CFG to CNF - Example Set 2 | TOC by Mahesh Goyani | CodeCrucks

12:44

091 - Conversion of CFG to CNF - Example Set 1 | TOC by Mahesh Goyani | CodeCrucks

06:21

090 - Chomsky Normal Form (CNF)

13:26

089 - Simplifying Grammar (Removing Unit Productions) | TOC by Mahesh Goyani | CodeCrucks

07:30

088 - Simplifying Grammar (Removing e-Productions) | TOC by Mahesh Goyani | CodeCrucks

15:50

087 - Simplifying Grammar (Removing Uselss Symbols) | TOC by Mahesh Goyani | CodeCrucks

09:29

086 - Ambiguous Grammar |TOC by Mahesh Goyani | CodeCrucks

24:21

085 - Construction of Context Free Grammar (a^n, a^nb^m, ...) | TOC by Mahesh Goyani | CodeCrucks

11:37

084 - Construction of Context Free Grammar (Palindrome) | TOC by Mahesh Goyani | CodeCrucks

15:46

083 - Construction of Context Free Grammar (RL to CFG) | TOC By Mahesh Goyani | CodeCrucks

06:04

082 - Construction of Context Free Grammar (FA to CFG) | TOC by Mahesh Goyani | CodeCrucks

23:51

081 - Introduction to Context Free Grammar | TOC by Mahesh Goyani | CodeCrucks

10:19

050 - NFA vs DFA | TOC by Mahesh Goyani | CodeCrucks

07:12

049 - Conversion of ε-NFA to DFA - Example 2 | TOC by Mahesh Goyani | CodeCrucks

09:09

048 - Conversion of ε-NFA to DFA - Example 1 | TOC by Mahesh Goyani | CodeCrucks

05:56

047 - Conversion of ε-NFA to NFA - Example 3 | TOC by Mahesh Goyani | CodeCrucks

07:11

046 - Conversion of ε-NFA to NFA - Example 2 | TOC by Mahesh Goyani | CodeCrucks

11:49

045 - Conversion of ε-NFA to NFA - Example 1 | TOC by Mahesh Goyani | CodeCrucks

08:41

044 - ε-closure | TOC by Mahesh Goyani | CodeCrucks

13:31

043 - Introduction to ε-NFA | TOC by Mahesh Goyani | CodeCrucks

06:28

042 - Conversion of NFA to DFA - Example 5 | TOC by Mahesh Goyani | CodeCrucks

15:49

022 - Example of DFA (Substring) | TOC by Mahesh Goyani | CodeCrucks

13:13

021 - Example of DFA (Begin and End With) [ TOC by Mahesh Goyani ] - CodeCrucks

18:30

020 - Example of DFA (Counting of Symbols) | TOC by Mahesh Goyani | CodeCrucks

11:31

019 - Example of DFA (Position of Symbols) [ TOC by Mahesh Goyani ] - CodeCrucks

23:46

018 - Example of DFA (Modulo) | TOC by Mahesh Goyani | CodeCrucks

28:32

017 - Introduction to Deterministic Finite Automata | DFA | TOC by Mahesh Goyani | CodeCrucks

15:38

016 - Introduction to Finite Automata | TOC by Mahesh Goyani | CodeCrucks

19:17

015 - Formal Language | TOC by Mahesh Goyani | CodeCrucks

18:09

014 - Logic [ TOC by Mahesh Goyani ] - CodeCrucks

13:01

013 - Indirect Proof - Contra Positive and Contradiction [ TOC by Mahesh Goyani ] - CodeCrucks

07:33

012 - Direct Proof - Constructive Proof [ TOC by Mahesh Goyani ] - CodeCrucks

04:14

011 - Inductive Proof - Example 3 (7 + 13 + 19 + … + (6n + 1) = n(3n + 4)) | TOC by Mahesh Goyani

05:50

010 - Inductive Proof - Example 1 (1 + 4 + 7 + … + (3n – 2) = n(3n – 1) by 2) | TOC by Mahesh Goyani

04:18

009 - Inductive Proof - Example 2 (1 + 2 + … + n = n(n+1) by 2) | TOC by Mahesh Goyani | CodeCrucks

07:13

008 - Inductive Proof (2^x GE x^2) | TOC by Mahesh Goyani | CodeCrucks

12:26

007 - Deductive Proof with Example | TOC by Mahesh Goyani | CodeCrucks

20:11

006 - Functions - Types and Properties | TOC by Mahesh Goyani | CodeCrucks

18:22

005 - Examples on Relations | TOC by Mahesh Goyani | CodeCrucks

19:54

004 - Relation and Types of Relation | TOC by Mahesh Goyani | CodeCrucks

08:45

003 - Properties of Set | involution | associative | Distributive| TOC by Mahesh Goyani | CodeCrucks

16:00

002 - Set Operations | Union | Symmetric difference | TOC by Mahesh Goyani | CodeCrucks

19:41

001 - Introduction to Set Theory [ TOC by Mahesh Goyani ] - CodeCrucks

07:07

041 - Conversion of NFA to DFA - Example 4 | TOC by Mahesh Goyani | CodeCrucks

05:17

040 - Conversion of NFA to DFA - Example 3 | TOC by Mahesh Goyani | CodeCrucks

05:35

039 - Conversion of NFA to DFA - Example 2 | TOC by Mahesh Goyani | - CodeCrucks

10:37

038 -Conversion of NFA to DFA - Example 1 | TOC by Mahesh Goyani | CodeCrucks

07:05

037 - Examples of NFA | TOC by Mahesh Goyani | CodeCrucks

13:01

036 - Examples of DFA & NFA | TOC by Mahesh Goyani | CodeCrucks

24:18

035 - Introduction to Non Deterministic Finite Automata | NFA | TOC by Mahesh Goyani | CodeCrucks

12:29

034 - Minimization of DFA | Equivalency Matrix | TOC by Mahesh Goyani | CodeCrucks

05:38

033 - Example of Minimization of DFA | State Minimization | TOC by Mahesh Goyani | CodeCrucks

04:54

032 - Example of Minimization of DFA | State Minimization | TOC by Mahesh Goyani | CodeCrucks

08:22

031 - Example of Minimization of DFA | State Minimization | TOC by Mahesh Goyani | CodeCrucks

05:54

030 - Example of Minimization of DFA | State Minimization | TOC by Mahesh Goyani | CodeCrucks

11:52

029 - Minimization of DFA | State Minimization | Minimizing DFA | TOC by Mahesh Goyani | CodeCrucks

20:34

028 - Closure Properties of Regular Language and DFA | TOC by Mahesh Goyani | CodeCrucks

08:53

027 - Examples of Equivalence of DFA | Equivalent DFAs | TOC by Mahesh Goyani | CodeCrucks

11:56

026 - Equivalence of DFA | Equivalent DFA | Combined DFA | TOC by Mahesh Goyani | CodeCrucks