A Review Paper on Pushdown Automata Implementation

EasyChair Preprint no. 7677

Abstract

Pushdown Automata is a finite automaton with an additional data input segment called stack that helps in recognizing Context Free Languages. We can compare it to finite automata, but the exception is that because of stacks, it is able to handle infinite strings. This paper consists of review and survey of other projects related to Pushdown Automata implementation and Comparative study of other projects which have implemented PDA. Theoretical information of PDA would help to understand it better and design our problem statement. We plan to design PDA applications that will help to study PDA operations properly with the help of transition tables. —  Pushdown Automata is a finite automaton with an additional data input segment called stack that helps in recognizing Context Free Languages. We can compare it to finite automata, but the exception is that because of stacks, it is able to handle infinite strings. This paper consists of review and survey of other projects related to Pushdown Automata implementation and Comparative study of other projects which have implemented PDA. Theoretical information of PDA would help to understand it better and design our problem statement. We plan to design PDA applications that will help to study PDA operations properly with the help of transition tables.

Keyphrases: automata theory, palindrome, pushdown automata

@Booklet{EasyChair:7677,
  author = {Aditya Akangire and Sarthak Akkarbote and Kartik Rupauliha and Ayush Vispute and Abdul Mueed},
  title = {A Review Paper on Pushdown Automata Implementation},
  howpublished = {EasyChair Preprint no. 7677},

  year = {EasyChair, 2022}}