SLS Tutorials

25:46

Turing Machine for a^nb^n // Design Turing Machine a*b* // Automata TOC

06:25

Turing Machine Example aa^n // Design Turing Machine aa* // Automata TOC

16:47

Introduction to Turing Machine and its Definition in Urdu // TOC Automata

07:12

Mealy Machine Example and Transition Table // Theory of Computation // Finite Automata

12:35

Mealy Machine in TOC // Formal Definition Mealy Machine in Urdu // Theory of Automata

10:54

Moore Machine Example 1's Complement and Transition Table // Theory of Automata

18:32

Moore Machine in TOC with example // What is Moore Machine in Urdu

13:32

Convert CFG to PDA Push Down Automata // Theory of Computation // Context Free Grammar

13:19

PDA Example string L(M) = a^n b^2n in TOC // Push Down Automata // Theory of Computation

19:48

PDA Example for a and b are equal //Push Down Automata // Theory of Computation

16:58

PDA for Two Equal Length Strings // Push Down Automata // Theory of Computation

18:32

PDA Example Reverse of string { L(M)=ww^r } in TOC // Push Down Automata // Theory of Computation

16:32

PDA Example (a^n b^n) in TOC | Push Down Automata Theory of Computation

16:35

Basic of Pushdown Automata in TOC | PDA in Automata Theory of Computation

08:33

Greibach Normal Form | CFG to GNF | Theory of Computation | Automata TOC

09:21

Chomsky Normal Form // CFG to CNF Conversion in Automata Theory TOC

14:22

Chomsky vs Greibach | CNF vs GNF | Normal Form of CFG in TOC | CFG Conversion

16:08

Conversion Ambiguous to Unambiguous Grammar CFG // Context Free Grammar in Automata TOC

11:59

CFG Ambiguous Grammar in TOC // Ambiguous Context Free Grammar in Automata

09:49

🌲 Derivation Tree of CFG // Parse Tree in Automata Theory TOC // CFG Derivation

19:06

CFG Derivation // Left Most & Right Most Derivation in CFG // Automata Lectures TOC

21:29

Convert DFA to CFG // Context Free Grammar in Automata Theory TOC

11:24

CFG Examples in Automata // Context Free Grammar Examples Solved TOC

13:19

What is Context Free Grammar in TOC // Examples of CFG in Theory of Automata

11:36

Intersection of two Finite Automata TOC // Theory of Automata // Regular Language

14:28

Properties for Regular Languages in Automata Theory of Computation - TOC

08:31

Regular Expression from Generalized Transition Graph in Automata TOC / Theory of Computation

22:01

Regular Expression Examples in TOC // Theory of Computation Lectures

14:30

Regular Expressions in TOC // RE Example in Theory of Finite Automata

20:55

Convert NFA to DFA with example in Urdu // Equivalence of DFA // Direct Method or Transition Table

10:46

NFA Example // Design NFA ab (bb + bba)* ba {OR} ab (bb + bab)* a // NFA Designing // TOC in Urdu

13:02

NFA Example // w contains at least two 0s, or exactly two 1s // NFA Designing // TOC in Urdu

10:26

Design NFA (ab + aba)* asterisk // NFA example // NFA Designing / TOC in Urdu

10:12

Design NFA a* + (ab)* asterisk // NFA example / NFA Designing // TOC in Urdu // Non Deterministic

10:11

Design NFA for (01)* and (ab)* asterisk // NFA example / NFA Designing // TOC in Urdu

25:54

NFA vs DFA differences with examples // ToC // Deterministic & Non Deterministic Finite Automata

19:05

Introduction to NFA - Non Deterministic Finite Automata // TOC / Automata Theory

14:08

DFA for language Even No of a's and Odd No of b's without sequence / DFA Design Automata / TOC

11:05

DFA Example for the language a^n b^m, n is even & m is odd / DFA Design / TOC / Automata

08:12

DFA Example for the language Even and Odd Number of a's // DFA Design / TOC / Automata

12:07

DFA Example for the language aWb W:(a,b)* asterisk // DFA Design / TOC / Automata

10:02

DFA Example for the language a^nb (n is greater than or equal to 0) DFA Design / TOC / Automata

07:06

DFA Example / All binary strings without substring 001 - How to Construct DFA

09:42

DFA Example // All binary strings containing substring 001 - How to Construct DFA

13:09

DFA Example // All binary strings End with Substring 001 - How to Construct DFA

10:08

DFA Example // All Binary strings start with 001 - How to Construct DFA

08:14

DFA Example // All strings with prefix ab - How to Construct DFA

19:00

Introduction to DFA - Deterministic Finite Automata // TOC Automata Theory

19:01

Finite Automata Language Example with Detail Explanation // Theory of Automata and Formal Language

12:58

Basic Operations on String TOC // THEORY OF COMPUTATION // THEORY of AUTOMATA

16:21

What is Language in TOC with Examples // Theory of Computation // What is Automata