SM E-Learning

TOC - EQUIVALENCE OF CFG AND PDA - CONVERSION FROM CFG TO PDA

SM E-Learning

TOC - EQUIVALENCE OF CFG AND PUSH DOWN AUTOMATA- FROM PDA TO CFG

SM E-Learning

TOC PUSH DOWN AUTOMATA FOR THE LANGUAGE a^nb^ma^n

SM E-Learning

TOC PUSH DOWN AUTOMATA FOR THE L= {a^nb^mc^md^n such that m and n are integers}

SM E-Learning

TOC - PUSH DOWN AUTOMATA for the language L ={wwRw belongs to (0,1)}

SM E-Learning

TOC PUSH DOWN AUTOMATA - DEFINITION

SM E-Learning

GNF GREIBACH NORMAL FORM

SM E-Learning

CNF Chomsky normal form

SM E-Learning

Simplification of CFG elimination of epsilon unit useless productions

SM E-Learning

TOC AMBIGUOUS GRAMMAR IN CFG

SM E-Learning

TOC CFG parse trees DERIVATION TREES

SM E-Learning

TOC LEFT AND RIGHT MOST DERIVATIONS IN CONTEXT FREE GRAMMAR

SM E-Learning

TOC CFG FOR THE EXPRESSION (a+b)(a+b+0+1) problem 2

SM E-Learning

TOC CONTEXT FREE GRAMMAR FOR PALINDROME PROBLEM 1

SM E-Learning

TOC PUMPIMG LEMMA FOR REGULAR LANGUAGES PROBLEM 2

SM E-Learning

PUMPING LEMMA FOR REGULAR LANGUAGES

SM E-Learning

TOC - MINIMIZATION OF DFA WITH NOT REACHABLE STATES

SM E-Learning

TOC - MINIMIZATION OF DFA BY TABLE FILLING ALGORITHM

SM E-Learning

TOC - REGULAR EXPRESSION TO EPSILON NFA - PROBLEM 1

SM E-Learning

FINITE AUTOMATA TO REGULAR EXPRESSION USING STATE ELIMINATION METHOD WITH 2 FINAL STATES-PROBLEM 2

SM E-Learning

DFA TO REGULAR EXPRESSION USING STATE ELIMINATION METHOD WITH SAME STATE AS START AND FINAL STATE

SM E-Learning

TOC - DFA TO REGULAR EXPRESSION USING - STATE ELIMINATION METHOD

SM E-Learning

TOC DFA TO REGULAR EXPRESSION PROBLEM 2

SM E-Learning

TOC DFA TO REGULAR EXPRESSION with 2 states - PROBLEM

SM E-Learning

TOC - DFA TO REGULAR EXPRESSION

SM E-Learning

TOC REGULAR EXPRESSION INTRODUCTION - OPERATORS IN REGULAR EXPRESSIONS, PRECEDENCE

SM E-Learning

THEORY OF COMPUTATION - EPSILON NFA TO DFA

SM E-Learning

THEORY OF COMPUTATION - EPSILON NFA PROBLEM

SM E-Learning

THEORY OF COMPUTATION - PROBLEM NFA TO DFA

SM E-Learning

THEORY OF COMPUTATION - EQUIVALENCE OF NFA & DFA

SM E-Learning