Sharon Roji

Automata Theory Lecture #39 Turing Machine

Sharon Roji

Automata Theory Lecture #38 PDA_Example5

Sharon Roji

Automata Theory Lecture #35 PDA_Example2

Sharon Roji

Automata Theory Lecture #37PDA_Example4

Sharon Roji

Automata Theory Lecture #36PDA_Example3

Sharon Roji

Automata Theory Lecture #33 PDA

Sharon Roji

Automata Theory Lecture #34 Continuation of Lecture #33

Sharon Roji

Automata Theory Lecture #32 CNF

Sharon Roji

Automata Theory Lecture #31 Left Recursion

Sharon Roji

Automata Theory Lecture #27 Finding Equivalent Unambiguous Grammar

Sharon Roji

Automata Theory Lecture #26Techniques for Reducing Ambiguous Grammar

Sharon Roji

Automata TheoryLecture #25 Ambiguous Grammar

Sharon Roji

Automata Theory Lecture #30Simplifying CFG

Sharon Roji

Automata TheoryLecture #29 Designing CFG Part2

Sharon Roji

Automata TheoryLecture#28Designing CFG

Sharon Roji

Automata TheoryLecture #20 Regular Grammar

Sharon Roji

Automata TheoryLecture#23CFG_Derivations Part2

Sharon Roji

Automata TheoryLecture#24 CFG_Parse Tree

Sharon Roji

Automata TheoryLecture #22CFG_Derivations

Sharon Roji

Automata TheoryLecture #21Finite Automata to Regular Grammar

Sharon Roji

Automata Theory Lecture #19 From Finite Automata to RE

Sharon Roji

Automata Theory Lecture #18 From RE to Finite Automata Part 2

Sharon Roji

Automata Theory Lecture #17 From RE to Finite Automata Part 1

Sharon Roji

Automata Theory Lecture #15 Building Regular Expression Part1

Sharon Roji

Automata Theory Lecture #16 Building Regular Expression Part2

Sharon Roji

Automata Theory Lecture #14 Regular Expression

Sharon Roji

Automata Theory Lecture #13 Minimizing FSM

Sharon Roji

Automata Theory Lecture #12 From FSM to Operational Systems

Sharon Roji

Automata Theory Lecture #11 Finite State Transducer

Sharon Roji

Automata Theory Lecture #10 Conversion from episilon NFA to DFA

Sharon Roji