Easy Computer Engineering

5.46K subscribers

118 videos

The goal of my channel is to share knowledge. Please do watch Playlist of Theory of Computation(TOC), System Programming(SP), Compiler Design, Software Lab V...

Latest Videos

Designing a Post Machine for L = { aⁿbⁿ } Step-by-Step Explanation #PDA Example 1TOC Lect 68

Post Machine Definition & Transition Functions Basic & Explanation Example 1 TOC Lecture 67

Design Pushdown Automata for Palindrome WcWᴿ PDA Example 6 PDA 8 TOC Lecture 66

Design Pushdown Automata for aⁿb²ⁿ PDA Example 5 PDA 7 TOC Lecture 65

Design Pushdown Automata for Equal Number of 'a' and 'b' PDA Example 4 PDA 6 TOC Lecture 64

Design Pushdown Automata for Language aⁿbᵐ n is Less m PDA Example 3 PDA 5 TOC Lecture 63

Design Pushdown Automata for Language aⁿbᵐ n bigger m PDA Example 2 PDA 4 TOC Lecture 62

Design Pushdown Automata for Language aⁿbⁿ PDA Example 1 PDA 3 TOC Lecture 61

Formal Definition of PDA and Stack Operations in PDA PDA 2 Theory of Computation TOC Lecture 60

Basics of Pushdown Automata PDA 1 Theory of Computation TOC Lecture 59

Greibach Normal Form (GNF) Explained with Example Theory of Computation TOC Lecture 58

Chomsky Normal Form of a Grammar Example 2 Theory of Computation TOC Lecture 57

Chomsky Normal Form of a Grammar Example 1 Theory of Computation TOC Lecture 56

Simplification of Context Free Grammar(CFG) Reduction of Context Free Grammar TOC Lect 55

Elimination of Unit Production Part 3 Simplification of Context Free Grammar(CFG) TOC Lect 54

Elimination of Epsilon Production Part 2 Simplification or Reduction of CFG TOC Lecture 53

Elimination of Useless Symbols, Non-Reachable & Non-Generating Symbols Part 1 TOC Lecture 52

Writing Grammar for a Language Context-Free Grammar (CFG) Examples TOC Lecture 50

Context-Free Grammar Derivation Process Leftmost & Rightmost Derivation TOC Lecture 49

Introduction to Context-Free Grammar and Languages Formal Definition & Examples TOC Lecture 48

Finite Automata in 5 Hours Complete Finite Automata in Theory of Computation TOC

How to Solve Using Pumping Lemma Example 3 Theory of Computation Part 3 TOC Lecture 47

How to Solve Using Pumping LemmaPalindrome ExampleTheory of Computation Part 2 TOC Lecture 46

Pumping Lemma for Regular Languages & Example Theory of Computation Part 1 TOC Lecture 45

Find Regular Expression (R.E.) for FA Using Arden's Theorem University Example TOC Lecture 44

Find Regular Expression (R.E.) for Finite Automata Using Arden's Theorem TOC Lecture 43

Proof of Arden’s Theorem in Theory of Computation TOC Lecture 42

How to Write a Regular Expression for a Given Finite Automata TOC Lecture 41

How to Write a Regular Language for a Given Regular Expression TOC Lecture 40

How to Construct NFA for a Given Regular Expression Step-by-Step Examples TOC Lecture 39