Computing Spectrum

PDA part 2

Computing Spectrum

Mealy machine increment and decrement of 2 in binary

Computing Spectrum

CFG for Non Regular Languages

Computing Spectrum

Push Down Automata Introduction

Computing Spectrum

Moore and Mealy Machines complete

Computing Spectrum

CFG for Regular Languages

Computing Spectrum

Union Concatenation and of NFAs and TGs

Computing Spectrum

NFA to DFA conversion by using Transition Table

Computing Spectrum

Pumping leema for Regular Languages

Computing Spectrum

Kleene's Theorem Part Ill( union, concatenation, operation)

Computing Spectrum

Kleene's Theorem Part I & Part ll

Computing Spectrum

DFA of two conditions, NFA, TG

Computing Spectrum

Introduction to DFA Part 1( start, end, substring)

Computing Spectrum

DFA Part 3 (2nd last letter b, at least, at most, not, Even-Even)

Computing Spectrum

DFA part 2 ( Even, Odd, multiples, at least length, at most length, exactly length)

Computing Spectrum

Egg Thief Monitor Lizard Finished at Last!

Computing Spectrum

Caught on Camera Monitor Lizard vs Hen’s Egg

Computing Spectrum

Introduction to Regular Expression part 1

Computing Spectrum

Introduction to Regular Expression part 2

Computing Spectrum

PDA for non regular languages part 2

Computing Spectrum

PDA for Equal Equal language

Computing Spectrum

PDA For Non Regular Languages part 1

Computing Spectrum

How to write Review paper

Computing Spectrum

Moore and Mealy Machine in Theory of Computation

Computing Spectrum

Graph Introduction and BFS

Computing Spectrum

Depth First Search

Computing Spectrum

Analysis of Algorithm Heap Sort

Computing Spectrum

Analysis of Algorithms Growth of Complexity part 2

Computing Spectrum

Data Structure Converting infix to postfix

Computing Spectrum

Analysis of Algorithms Growth of Complexity

Computing Spectrum