Все публикации

0:12:52

Regular Expression | Regular Expression in TOC with Example | How to Write Regular Expression Part 1

0:17:11

Grammar | How to Write Grammar in Automata | Theory of Computation Grammar Part 2 | Grammar in TOC

0:13:08

Grammar | How to Write Grammar in Automata | Theory of Computation Grammar Part 3 | Grammar in TOC

0:09:15

Grammar | Write Grammar to generate Set of all Palindromes | Odd & Even length Palindrome Part 5 TOC

0:07:34

Grammar | How to Write Grammar in Automata | Theory of Computation Grammar Part 8 | Grammar in TOC

0:07:19

Grammar | How to Write Grammar in Automata | Theory of Computation Grammar Part 7 | Grammar in TOC

0:12:28

Regular Expression | Regular Expression in TOC with Example | How to Write Regular Expression Part 3

0:09:34

Regular Expression | Regular Expression in TOC with Example | How to Write Regular Expression Trick

0:07:36

Grammar | How to Write Grammar in Automata | Theory of Computation Grammar Part 9| Regular Grammar?

0:14:06

Conversion from Epsilon NFA to NFA | Eliminate Null Moves from NFA | Epsilon NFA to NFA conversion

0:25:05

Epsilon NFA in Hindi | ε-NFA Formal Definition | Conversion from Epsilon NFA to NFA |Automata Course

0:12:53

Grammar | How to Write Grammar in Automata | Theory of Computation Grammar Part 6 | Regular Grammar?

0:17:43

Grammar | How to Write Grammar in Automata | Theory of Computation Grammar Part 1 | Regular Grammar?

0:05:47

Convert Mealy Machine to Moore Machine | Mealy Machine to Moore Machine Conversion | Part - 2 Trick

0:15:46

Convert Mealy Machine to Moore Machine | Mealy Machine to Moore Machine Conversion | Part - 1 Trick

0:14:02

Convert Moore Machine to Mealy Machine | Moore Machine to Mealy Machine Conversion | Shortcut Trick

0:13:09

Convert Moore Machine to Mealy Machine | Moore Machine to Mealy Machine Conversion | Shortcut Trick

0:15:39

Mealy machine Designing with Examples| Find 2's & 1s Complement of a Binary Number | Shortcut Trick

0:08:57

Automata Theory | Moore machine Designing with Examples | Moore Machine in Automata | TOC GATE CS IT

0:10:43

Automata Theory | Moore machine Designing with Examples | Moore Machine in Automata | TOC GATE CS IT

0:16:31

Frequency Count Method | How to Analysis an Algorithm ? | Time Complexity Analysis | Part 2 Gate CS

0:10:48

Frequency Count Method | How to Analysis an Algorithm ? | Time Complexity Analysis | Part 3 Gate CS

0:05:53

Design a Moore machine which prints '1' for every occurrence of 'baa' as substring. | TOC GATE CSIT

0:12:16

Fractional Knapsack Problem Introduction | Approach of Knapsack Problem using Greedy Method |Example