Abstract
Flip-pushdown automata, introduced by Sarkar [7], are pushdown automata with an additional ability to reverse the contents of their pushdown, and with the most interesting setting arising when the number of such flips is limited by a constant. Two characterizations of flip-pushdown automata (with a limited number of flips) in terms of grammars are presented in this paper. First, the model is characterized by context-free grammars with an extra ability to generate reversals, which are called reversal-generating context-free grammars (RGCFG). Next, a model of parallel word production called parallel interleaving grammar system (PIGS) is introduced, for which the equivalence with flip-pushdown automata is proved, linking flip-pushdown automata to parallelism. The characterization in terms of PIGS is used to prove that flip-pushdown automata (with a limited number of flips) are weaker than ET0L systems, which solves an open problem of Holzer and Kutrib [2].
This work has been supported by the grants VEGA 1/0979/12 and UK/322/2014.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ďuriš, P., Košta, M.: Flip-Pushdown Automata with k Pushdown Reversals and E0L Systems are Incomparable. Inform. Process. Lett. 114, 417–420 (2014)
Holzer, M., Kutrib, M.: Flip-Pushdown Automata: k + 1 Pushdown Reversals Are Better than k. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 490–501. Springer, Heidelberg (2003)
Holzer, M., Kutrib, M.: Flip-Pushdown Automata: Nondeterminism is Better than Determinism. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 361–372. Springer, Heidelberg (2003)
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Reading (2001)
Mateescu, A., Rozenberg, G., Salomaa, A.: Shuffle on trajectories: Syntactic constraints. Theor. Comput. Sci. 197, 1–56 (1998)
Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, London (1980)
Sarkar, P.: Pushdown automaton with the ability to flip its stack. Report No. 81, Electronic Colloquium on Computational Complexity (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kostolányi, P. (2015). Two Grammatical Equivalents of Flip-Pushdown Automata. In: Italiano, G.F., Margaria-Steffen, T., Pokorný, J., Quisquater, JJ., Wattenhofer, R. (eds) SOFSEM 2015: Theory and Practice of Computer Science. SOFSEM 2015. Lecture Notes in Computer Science, vol 8939. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46078-8_25
Download citation
DOI: https://doi.org/10.1007/978-3-662-46078-8_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-46077-1
Online ISBN: 978-3-662-46078-8
eBook Packages: Computer ScienceComputer Science (R0)