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.
A direct construction of finite state automata for pushdown store languages / V. Geffert, A. Malcher, K. Meckel, C. Mereghetti, B. Palano (LECTURE NOTES IN COMPUTER SCIENCE). - In: Descriptional complexity of formal systems / [a cura di] H. Jurgensen, R. Reis. - Berlin : Springer, 2013. - ISBN 9783642393099. - pp. 90-101 (( Intervento presentato al 15. convegno International workshop on Descriptional complexity of formal systems tenutosi a London nel 2013 [10.1007/978-3-642-39310-5_10].
A direct construction of finite state automata for pushdown store languages
C. Mereghetti;B. PalanoUltimo
2013
Abstract
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.File | Dimensione | Formato | |
---|---|---|---|
pubblicato.pdf
accesso riservato
Tipologia:
Publisher's version/PDF
Dimensione
225.01 kB
Formato
Adobe PDF
|
225.01 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.