Abstract
Flip-pushdown automata are pushdown automata with the additional ability to flip or reverse its pushdown. We investigate deterministic and nondeterministic flip-pushdown automata accepting by final state or empty pushdown. In particular, for nondeterministic flip-pushdown automata both acceptance criterion are equally powerful, while for determinism, acceptance by empty pushdown is strictly weaker. This nicely fits into the well-known results on ordinary pushdown automata. Moreover, we consider hierarchies of flip-pushdown automata w.r.t. the number of pushdown reversals. There we show that nondeterminism is better than determinism. Moreover, since there are languages which can be recognized by a deterministic flip-pushdown automaton with k + 1 pushdown reversals but which cannot be recognized by a k-flip-pushdown (deterministic or nondeterministic) as shown in [9] we are able to complete our investigations with incomparability results on different levels of the hierarchies under consideration.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ch. Bader and A. Moura. A generalization of Ogden’s lemma. Journal of the ACM, 29(2):404–407, 1982.
N. Chomsky. Handbook of Mathematic Psychology, volume 2, chapter Formal Properties of Grammars, pages 323–418. Wiley & Sons, New York, 1962.
S. N. Coole. Deterministic pushdown store machines and real-time computations. Journal of the ACM, 18:306–328, 1971.
R. J. Evey. The Theory and Applications of Pushdown Store Machines. Ph.D thesis, Harvard University, Massachusetts, May 1963.
S. Ginsburg. Algebraic and Automata-Theoretic Properties of Formal Languages. North-Holland, Amsterdam, 1975.
S. Ginsburg, S. A. Greibach, and M. A. Harrison. One-way stack automata. Journal of the ACM, 14(2):389–418, April 1967.
S. Ginsburg and E. H. Spanier. Finite-turn pushdown automata. SIAM Journal on Computing, 4(3):429–453, 1966.
S. A. Greibach. An infinite hierarchy of context-free languages. Journal of the ACM, 16(1):91–106, January 1969.
M. Holzer and M. Kutrib. Flip-pushdown automata: k +1 pushdown reversals are better than k. In Proceedings of the 30th International Colloquium on Automata, Languages, and Programming, LNCS, Eindhoven, Netherlands, June–July 2003. Springer. To appear.
G. Rozenberg and A. Salomaa. The Mathematical Theory of L Systems, volume 90 of Pure and Applied Mathematics. Academic Press, 1980.
P. Sarkar. Pushdown automaton with the ability to flip its stack. Report TR01-081, Electronic Colloquium on Computational Complexity (ECCC), November 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Holzer, M., Kutrib, M. (2003). Flip-Pushdown Automata: Nondeterminism is Better than Determinism. In: Ésik, Z., Fülöp, Z. (eds) Developments in Language Theory. DLT 2003. Lecture Notes in Computer Science, vol 2710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45007-6_29
Download citation
DOI: https://doi.org/10.1007/3-540-45007-6_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40434-7
Online ISBN: 978-3-540-45007-8
eBook Packages: Springer Book Archive