• DOI:10.1007/978-3-642-39310-5_10
• Corpus ID: 16972255

A Direct Construction of Finite State Automata for Pushdown Store Languages

@inproceedings{Geffert2013ADC,
  title={A Direct Construction of Finite State Automata for Pushdown Store Languages},
  author={Viliam Geffert and Andreas Malcher and Katja Meckel and Carlo Mereghetti and Beatrice Palano},
  booktitle={DCFS},
  year={2013}
}

• V. Geffert, Andreas Malcher, +2 authors Beatrice Palano
• Published in DCFS 22 July 2013
• Computer Science

We provide a new construction of a nondeterministic finite automaton (NFA) accepting the pushdown store language of a given pushdown automaton (PDA). The resulting NFA has a number of states which is quadratic in the number of states and linear in the number of pushdown symbols of the given PDA. Moreover, we prove the size optimality of our construction. Beside improving some results in the literature, our approach represents an alternative and more direct proof of pushdown store language regularity. Finally, we give a characterization of the class of pushdown store languages.