Uniform Distributed Pushdown Automata Systems [chapter]

Fernando Arroyo, Juan Castellanos, Victor Mitrana
2012 Lecture Notes in Computer Science  
A distributed pushdown autómata system consists of several pushdown autómata 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 duplícate components without modifying the generated language, the identical components play an important role in distributed pushdown autómata systems. We consider here
more » ... m distributed pushdown autómata systems (UDPAS), namely distributed pushdown autómata systems having all components identical pushdown autómata. 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 investígate 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.
doi:10.1007/978-3-642-31623-4_5 fatcat:uub26eeee5fdlcmmkfirl5bauu