Abstract
A distributed pushdown automata system consists of several pushdown automata which work in turn on the input word placed on a common one-way input tape under protocols and strategies similar to those in which cooperating distributed (CD) grammar systems work. Unlike the CD grammar systems case, where one may add or remove duplicate components without modifying the generated language, the identical components play an important role in distributed pushdown automata systems. We consider here uniform distributed pushdown automata systems (UDPAS), namely distributed pushdown automata systems having all components identical pushdown automata.
We consider here just a single protocol for activating/deactivating components, namely a component stays active as long as it can perform moves, as well as two ways of accepting the input word: by empty stacks (all components have empty stacks) or by final states (all components are in final states), when the input word is completely read. We mainly investigate the computational power of UDPAS accepting by empty stacks and a few decidability and closure properties of the families of languages they define. Some directions for further work and open problems are also discussed.
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
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)
Bordihn, H., Kutrib, M., Malcher, A.: Undecidability and hierarchy results for parallel communicating finite automata. Int. J. Found. Comput. Sci. 22, 1577–1592 (2011)
Choudhary, A., Krithivasan, K., Mitrana, V.: Returning and non-returning parallel communicating finite automata are equivalent. Information Processing Letters 41, 137–145 (2007)
Csuhaj-Varju, E., Dassow, J.: On cooperating distributed grammar systems. J. Inform. Process. Cybern., EIK 26, 49–63 (1990)
Csuhaj-Varju, E., Dassow, J., Kelemen, J., Păun, G.: Grammar Systems. A grammatical approach to distribution and cooperation. Gordon and Breach (1994)
Csuhaj-Varju, E., MartÃn-Vide, C., Mitrana, V., Vaszil, G.: Parallel communicating pushdown automata systems. Int. J. Found. Comput. Sci. 11, 633–650 (2000)
Csuhaj-Varju, 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)
Dassow, J., Păun, G., Rozenberg, G.: Grammar systems. In: [16], vol. 2
Dassow, J., Mitrana, V.: Stack cooperation in multi-stack pushdown automata. J. Comput. System Sci. 58, 611–621 (1999)
Durfee, E.H., et al.: Cooperative distributed problem solving. In: Barr, A., Cohen, P.R., Feigenbaum, E.A. (eds.) The Handbook of AI, vol. 4. Addison-Wesley, Reading (1989)
Krithivasan, K., Sakthi Balan, M., Harsha, P.: Distributed processing in automata. Int. J. Found. Comput. Sci. 10, 443–464 (1999)
MartÃn-Vide, C., Mitrana, V.: Some undecidable problems for parallel communicating finite automata systems. Information Processing Letters 77, 239–245 (2001)
MartÃn-Vide, C., Mateescu, A., Mitrana, V.: Parallel finite automata systems communicating by states. Int. J. Found. Comput. Sci. 13, 733–749 (2002)
Meersman, R., Rozenberg, G.: Cooperating Grammar Systems. In: Winkowski, J. (ed.) MFCS 1978. LNCS, vol. 64, pp. 364–374. Springer, Heidelberg (1978)
Păun, G., Sântean, L.: Parallel communicating grammar systems: the regular case. Ann. Univ. Bucharest, Ser. Matem.-Inform. 38, 55–63 (1989)
Rozenberg, G., Salomaa, A.: Handbook of Formal Languages, vol. 1-3. Springer, Berlin (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arroyo, F., Castellanos, J., Mitrana, V. (2012). Uniform Distributed Pushdown Automata Systems. In: Kutrib, M., Moreira, N., Reis, R. (eds) Descriptional Complexity of Formal Systems. DCFS 2012. Lecture Notes in Computer Science, vol 7386. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31623-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-31623-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31622-7
Online ISBN: 978-3-642-31623-4
eBook Packages: Computer ScienceComputer Science (R0)