theory of computation


In this video i have discussed introduction of theory of computation. There are basically 4 types of languages: 1. Regular Language 2. Context Free Language(CFL) 3. Context Sensitive Language (CSL) 4. Recursive Enumerable Language.

Topics

1.1 Theory of Computation| Introduction by Nargish Gupta[Hindi/English]
Play

1.10 DFA Construction|Start and End With Different Symbol|Theory of Comutation|TOC by Nargish Gupta
Play

1.11 DFA Construction| Start and End with Same Symbol| TOC by Nargish Gupta [Hindi/English]
Play

1.12 DFA Construction| L={a^m b^n|m,n grater equal to 1} and L={a^m b^n|m,n grater equal to 0}|TOC
Play

1.13 DFA Construction| L={a^l b^m c^n|l,m,n greater equal 1} , L={a^l b^m c^n|l,m,n greater equal 0}
Play

1.14 DFA Construction|no of a's and b's are|even|odd|even-odd|odd-even|TOC by Nargish Gupta
Play

1.15 DFA Construction| L={WxW^R|x,W belongs to (a,b)^+}|Theory of Computation by Nargish Gupta
Play

1.16 DFA Construction|L={W|W belongs to (a,b)^*}W contains every string a followed by exactly 2 b's
Play

1.17 DFA Construction|L=Wbb|W belongs to {a,b}^*| Theory of Computation| TOC by Nargish Gupta
Play

1.18 DFA Construction|L=W|W belongs to {a,b}^* and last two bits are different|Theory of Computation
Play

1.19 DFA Construction| Theory of Computation| Language={a^m b^n|m=2,n=1}| Automata by Nargish Gupta
Play

1.2 Finite Automata| Types| Introduction of Theory of Computation by Nargish Gupta[Hindi/English]
Play

1.20 DFA Construction|L=xaw|x belongs to {a,b},w belongs to {a,b}^*| Theory of Computation| TOC
Play

1.21 DFA Construction|{L=w|w belongs to{a,b}^*,|w|mod3==0}|Theory of Computation by Nargish Gupta
Play

1.22 DFA Construction|Number of a is Divisible by 2 and b is divisible by 3|Theory of Computation
Play

1.23 DFA Construction|Number of States Calculation| Theory of Computation by Nargish Gupta
Play

1.24 DFA Equivalence| Equivalence of Two Finite Automata Example-2|Theory of Computation
Play

1.25 DFA Equivalence| Equivalence of Two Finite Automata Example-2|Theory of Computation
Play

1.26 DFA Construction|GATE Question-1|Theory of Computation by Nargish Gupta
Play

1.27 NFA Introduction|Formal Definition of Non- Deterministic Finite Automata|Theory of Computation
Play

1.28 NFA Construction|String Start and End with Different Symbol|Theory of Computation
Play

1.29 NFA Construction| Start and End With Same Symbol| Theory of Computation by Nargish Gupta
Play

1.3 DFA Construction| Binary No. Divisible by 3 by Nargish Gupta[Hindi/English]
Play

1.30 NFA Construction|String Contains Exactly, Atleast and Atmost 2 a's| Theory of Computation
Play

1.31 NFA Construction|String Contains Third Symbol from the Beginning is 0 and from LHS is 0
Play

1.32 NFA Construction| L={wa|w belongs to (a,b)*}|L={w1aw2|w1,w2 belongs to (a,b)*}|L={awb|w (a,b)*}
Play

1.33 NFA to DFA Conversion|Example-1|Theory of Computation by Nargish Gupta
Play

1.34 NFA to DFA Conversion|Example-2|Theory of Computation by Nargish Gupta
Play

1.35 NFA to DFA Conversion|Example-3|Theory of Computation by Nargish Gupta
Play

1.4 DFA Construction| Neither Accept '00' nor '11' as a Substring|TOC by Nargish Gupta
Play

1.5 DFA Construction| {0^n| n mod 3=2} by Nargish Gupta [Hindi/English]
Play

1.6 DFA Construction| Ending with the Substring ab|Theory of Computation|TOC by Nargish Gupta
Play

1.7 DFA Construction| Starting with a and Ending with b|Theory of Computation by Nargish Gupta
Play

1.8 DFA Construction| Length of the String is Divisible by 2|Divisible by 3| Divisible by 5|TOC
Play

1.9 DFA Construction| Length of the string is Exactly-3|Atleast-3|Atmost-3|TOC by Nargish Gupta
Play

Mealy to Moore Conversion Example-1 | Mealy & Moore Machine | Theory of Computation
Play

Mealy to Moore Conversion Example-2 | Mealy & Moore Machine | Theory of Computation
Play

Moore to Mealy Machine Conversion Example | Moore Machine | Mealy Machine
Play

Subscribe Now