TopGATE

Videos from TopGATE

Page 1 of 1 • 23 total videos

Right Linear Regular Grammar to Finite Automata | Formal Languages & Automata Theory | TOC
11:13

Right Linear Regular Grammar to Finite Automata | Formal Languages & Automata Theory | TOC

TopGATE
74 views
Grammar to Language Conversion with Examples | Formal Languages & Automata Theory | TOC
12:19

Grammar to Language Conversion with Examples | Formal Languages & Automata Theory | TOC

TopGATE
81 views
DFA Design | All Strings Starting with 'a' AND NOT Ending with 'b' | Automata Theory | TOC
6:17

DFA Design | All Strings Starting with 'a' AND NOT Ending with 'b' | Automata Theory | TOC

TopGATE
989 views
NFA Design | All Strings in which Last Symbol is '1' But NOT Containing '00' as a Substring | TOC
6:50

NFA Design | All Strings in which Last Symbol is '1' But NOT Containing '00' as a Substring | TOC

TopGATE
2.9K views
NFA Design | All Strings of (0, 1) having SECOND LAST Symbol as '1' | Automata Theory | TOC
5:08

NFA Design | All Strings of (0, 1) having SECOND LAST Symbol as '1' | Automata Theory | TOC

TopGATE
4.1K views
Introduction to NFA | Non-Deterministic Finite Automata in English | Automata Theory | TOC
7:27

Introduction to NFA | Non-Deterministic Finite Automata in English | Automata Theory | TOC

TopGATE
949 views
DFA Design | All Strings of 'C,H,A,R,I,O,T' having 'CAT' as a Substring | Automata Theory | TOC
7:52

DFA Design | All Strings of 'C,H,A,R,I,O,T' having 'CAT' as a Substring | Automata Theory | TOC

TopGATE
1.4K views
DFA Design | All Binary Strings Divisible by 3 | GATECSE | Automata Theory | TOC
7:43

DFA Design | All Binary Strings Divisible by 3 | GATECSE | Automata Theory | TOC

TopGATE
878 views
DFA Design | All Strings Starting with 'a' AND Ending with 'b' | Automata Theory | TOC
9:07

DFA Design | All Strings Starting with 'a' AND Ending with 'b' | Automata Theory | TOC

TopGATE
1.5K views
DFA Design | L = W1abW2 / W1, W2 ∈ (a, b)* | Automata Theory | TOC
4:54

DFA Design | L = W1abW2 / W1, W2 ∈ (a, b)* | Automata Theory | TOC

TopGATE
3.3K views
DFA Design | Accepts All Strings of (a, b) Starting with 'ab' | Automata Theory | TOC
4:53

DFA Design | Accepts All Strings of (a, b) Starting with 'ab' | Automata Theory | TOC

TopGATE
850 views
DFA Design | 'a' is Multiple of 3 and 'b' is Multiple of 2 | Na(w) mod 3= 0 and Nb(w) mod 2= 0 | TOC
12:31

DFA Design | 'a' is Multiple of 3 and 'b' is Multiple of 2 | Na(w) mod 3= 0 and Nb(w) mod 2= 0 | TOC

TopGATE
7.5K views
DFA Design | Accepts all Strings of (a,b) Ending with 'ab' | Automata Theory | TOC
7:08

DFA Design | Accepts all Strings of (a,b) Ending with 'ab' | Automata Theory | TOC

TopGATE
1.3K views
DFA Design | Even no of a's and even no of b's | Automata Theory | TOC
5:01

DFA Design | Even no of a's and even no of b's | Automata Theory | TOC

TopGATE
1.9K views
Introduction to Automata Theory & Formal Languages | Theory of Computation in English | ATFL | TOC
20:52

Introduction to Automata Theory & Formal Languages | Theory of Computation in English | ATFL | TOC

TopGATE
11.3K views
Turing Machine for Language L = 0^n 1^m 0^n 1^m | Automata Theory and Examples
26:27

Turing Machine for Language L = 0^n 1^m 0^n 1^m | Automata Theory and Examples

TopGATE
4.5K views
Turing Machine for Addition of Two Numbers | Turing Machine as Adder | Automata Theory | TOC
6:17

Turing Machine for Addition of Two Numbers | Turing Machine as Adder | Automata Theory | TOC

TopGATE
2.1K views
Turing Machine for Language L = ww^r in Automata Theory
16:17

Turing Machine for Language L = ww^r in Automata Theory

TopGATE
6.7K views
Turing Machine for L = wcw^r in English | Turing Machine for Language WCWr | Automata Theory | TOC
15:51

Turing Machine for L = wcw^r in English | Turing Machine for Language WCWr | Automata Theory | TOC

TopGATE
13.7K views
Designing a Turing Machine for the Language a^n b^n c^n
12:35

Designing a Turing Machine for the Language a^n b^n c^n

TopGATE
1.9K views
Turing Machine for the Language L = a^n b^n | Automata Theory
15:05

Turing Machine for the Language L = a^n b^n | Automata Theory

TopGATE
1.5K views
Introduction to Turing Machines in English | Turing Machine Definition | Automata Theory | TOC
22:44

Introduction to Turing Machines in English | Turing Machine Definition | Automata Theory | TOC

TopGATE
1.1K views
Introduction to Pushdown Automata (PDA) in Automata Theory
14:44

Introduction to Pushdown Automata (PDA) in Automata Theory

TopGATE
1.7K views