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

  • Course: Theory of Automata, Formal Languages and Computation
  • Discipline: Computer Science and Engineering
  • Faculty: Prof. Kamala Krithivasan
  • Institute: IIT Madras