**
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