Abstract
In (Csuhaj-Varjú et. al. 2000) Parallel Communicating Systems of Pushdown Automata (PCPA) were introduced and shown to be able to simulate nondeterministic one-way multi-head pushdown automata in returning mode, even if communication is restricted to be one-way having a single target component. A simulation of such centralized PCPA by one-way multi-head pushdown automata (Balan 2009) turned out to be incomplete (Otto 2012). Subsequently it was shown that centralized returning PCPA are universal even if the number of components is two (Petersen 2013) and thus are separated from one-way multi-head pushdown automata. Another line of research modified the definition of PCPA such that communication is asynchronous (Otto 2013). While the simulation of one-way multi-head pushdown automata is still possible, now a converse construction shows this model in returning mode to be equivalent to the one-way multi-head pushdown automaton in a very precise sense. It was left open, whether non-centralized returning PCPA of degree two are universal. In the first part of the paper we show this to be the case.
Then we turn our attention to Uniform Distributed Pushdown Automata Systems (UDPAS). These systems of automata work in turn on a single tape. We show that UPDAS accepting with empty stack do not form a hierarchy depending on the number of components and that the membership problem is complete in NP, answering two open problems from (Arroyo et. al. 2012).
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
Arroyo, F., Castellanos, J., Mitrana, V.: Uniform distributed pushdown automata systems. In: Kutrib, M., Moreira, N., Reis, R. (eds.) DCFS 2012. LNCS, vol. 7386, pp. 64–75. Springer, Heidelberg (2012)
Balan, M.S.: Serializing the parallelism in parallel communicating pushdown automata systems. In: Dassow, J., Pighizzini, G., Truthe, B. (eds.) 11th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2009, pp. 59–68 (2009), http://dx.doi.org/10.4204/EPTCS.3.5
Balan, M.S., Krithivasan, K., Mutyam, M.: Some variants in communication of parallel communicating pushdown automata. Journal of Automata, Languages and Combinatorics 8(3), 401–416 (2003)
Berglund, M., Björklund, H., Högberg, J.: Recognizing shuffled languages. In: Dediu, A.-H., Inenaga, S., Martín-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 142–154. Springer, Heidelberg (2011)
Csuhaj-Varjú, E., Martín-Vide, C., Mitrana, V., Vaszil, G.: Parallel communicating pushdown automata systems. Int. J. Found. Comput. Sci. 11(4), 633–650 (2000)
Csuhaj-Varjú, E., Mitrana, V., Vaszil, G.: Distributed pushdown automata systems: Computational power. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 218–229. Springer, Heidelberg (2003)
Manna, Z.: Mathematical Theory of Computation. McGraw-Hill, New York (1974)
Otto, F.: Centralized PC systems of pushdown automata versus multi-head pushdown automata. In: Kutrib, M., Moreira, N., Reis, R. (eds.) DCFS 2012. LNCS, vol. 7386, pp. 244–251. Springer, Heidelberg (2012)
Otto, F.: Asynchronous PC systems of pushdown automata. In: Dediu, A.-H., Martín-Vide, C., Truthe, B. (eds.) LATA 2013. LNCS, vol. 7810, pp. 456–467. Springer, Heidelberg (2013)
Petersen, H.: The power of centralized PC systems of pushdown automata. In: Jurgensen, H., Reis, R. (eds.) DCFS 2013. LNCS, vol. 8031, pp. 241–252. Springer, Heidelberg (2013)
Sipser, M.: Introduction to the Theory of Computation, 2nd edn., Thomson (2006)
Vollmar, R.: Über einen Automaten mit Pufferspeicherung (On an automaton with buffer-tape). Computing 5, 57–70 (1970), (in German)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Petersen, H. (2014). A Note on Pushdown Automata Systems. In: Jürgensen, H., Karhumäki, J., Okhotin, A. (eds) Descriptional Complexity of Formal Systems. DCFS 2014. Lecture Notes in Computer Science, vol 8614. Springer, Cham. https://doi.org/10.1007/978-3-319-09704-6_30
Download citation
DOI: https://doi.org/10.1007/978-3-319-09704-6_30
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09703-9
Online ISBN: 978-3-319-09704-6
eBook Packages: Computer ScienceComputer Science (R0)