Easy Computer Engineering
3.89K subscribers
13:12
Design a Post Machine for the language anbn: #Example 1|TOC | Lect 68
Easy Computer Engineering
8.1K views • 2 years ago
8:02
Definition and transition functions of Post Machine: Post Machine #Example 1| TOC | Lect 67
Easy Computer Engineering
7.7K views • 2 years ago
7:03
Design Pushdown Automata for palindrome WcWT # PDA Example6# PDA8 | TOC | Lect 66
Easy Computer Engineering
1.8K views • 3 years ago
5:05
Design Pushdown Automata for anb2n # PDA Example5# PDA7 | TOC | Lect 65
Easy Computer Engineering
742 views • 3 years ago
6:09
Design Pushdown Automata for equal number of 'a' and 'b' # PDA Example4# PDA6 | TOC | Lect 64
Easy Computer Engineering
1.1K views • 3 years ago
9:58
Design Pushdown Automata for language anbm, n smaller than m # PDA5 Example3# PDA5 | TOC | Lect 63
Easy Computer Engineering
682 views • 3 years ago
12:34
Design Pushdown Automata for language anbm, n bigger than m # PDA4 Example2# PDA4 | TOC | Lect 62
Easy Computer Engineering
1.3K views • 3 years ago
11:43
Design Pushdown Automata for language anbn # PDA Example1# PDA3 | TOC | Lect 61
Easy Computer Engineering
1.1K views • 3 years ago
10:32
Formal Definition of PDA and Operations on stack in PDA# PDA 2# Theory of Computation |TOC | Lect 60
Easy Computer Engineering
682 views • 3 years ago
6:10
Basics Push Down Automata # PDA 1# Theory of Computation |PDA 1| TOC | Lect 59
Easy Computer Engineering
1.1K views • 3 years ago
8:15
Greibach Normal Form of a Grammar : Example1 # Theory of Computation |TOC | Lect 58
Easy Computer Engineering
575 views • 3 years ago
17:55
Chomsky Normal Form of a Grammar: Example2 # Theory of Computation |TOC | Lect 57
Easy Computer Engineering
696 views • 3 years ago
9:18
Chomsky Normal Form of a Grammar: Example1 # Theory of Computation|TOC | Lect 56
Easy Computer Engineering
1K views • 3 years ago
14:37
Simplification of Context Free Grammar(CFG) Reduction of Context Free Grammar |TOC | Lect 55
Easy Computer Engineering
14K views • 3 years ago
4:42
Elimination of Unit Production| Part 3| Simplification of Context Free Grammar(CFG) |TOC | Lect 54
Easy Computer Engineering
1K views • 3 years ago
6:15
Elimination of Epsilon Production Part2 : Simplification or reduction of CFG |TOC | Lect 53
Easy Computer Engineering
2.8K views • 3 years ago
7:42
Elimination of Useless Symbol Non reachable symbol Non Generating Symbols: Part 1 |TOC | Lect 52
Easy Computer Engineering
4.6K views • 3 years ago
19:49
Writing Grammar for a Language # Theory of Computation |TOC | Lect 50
Easy Computer Engineering
1.2K views • 3 years ago
14:14
Context Free Grammar: Derivation Process # Theory of Computation |TOC | Lect49
Easy Computer Engineering
1K views • 3 years ago
8:07
Introduction of Context Free Grammar and Languages: # Theory of Computation|TOC | Lect48
Easy Computer Engineering
972 views • 3 years ago
5:18:20
Finite Automata in 5 hours || Finite Automata in Theory of Computation | TOC | Chapter1
Easy Computer Engineering
755 views • 3 years ago
7:23
How to solve using Pumping Lemma Example# Theory of Computation :Part3 | TOC | Lect47
Easy Computer Engineering
452 views • 3 years ago
6:24
How to solve using Pumping Lemma Example #Theory of Computation :Part2 | TOC | Lect46
Easy Computer Engineering
1K views • 3 years ago
8:46
Pumping Lemma for Regular Language and Example #Theory of Computation :Part1 | TOC | Lect45
Easy Computer Engineering
765 views • 3 years ago
8:15
Find R.E. for FA using Arden's Theorem? Example 2 # Theory of Computation | TOC | Lect44
Easy Computer Engineering
477 views • 3 years ago
13:02
Find R.E. for FA using Arden's Theorem? #Theory of computation | TOC | Lect43
Easy Computer Engineering
621 views • 3 years ago
6:49
What is proof of Arden's Theorem in Theory of Computation? | TOC | Lect42
Easy Computer Engineering
528 views • 3 years ago
10:01
How to write a Regular Expression for given Finite Automata? #Theory of computation | TOC | Lect41
Easy Computer Engineering
1K views • 3 years ago
10:30
How to write a regular language for given regular expression #Theory of computation| TOC | Lect40
Easy Computer Engineering
2.1K views • 3 years ago
10:28
Theory of computation :How to construct NFA for given Regular Expression | TOC| Lect39
Easy Computer Engineering
35K views • 3 years ago
Load More