NPTEL Lecture : 'PUSHDOWN AUTOMATA , EQUIVALENCE BETWEEN ACCEPTANCE BY EMPTY STORE AND ACCEPTANCE BY FINAL STATE '
PUSHDOWN AUTOMATA , EQUIVALENCE BETWEEN ACCEPTANCE BY EMPTY STORE AND ACCEPTANCE BY FINAL STATE
Watch Theory of Automata, Formal Languages and Computation ('Computer Science and Engineering' course from IIT Madras) Video Lectures
by Prof. Kamala Krithivasan.