Teams of Pushdown Automata

Ter Beek M. H, Csuhaj-Varju E., Mitrana V.

Computational Theory and Mathematics  Team cooperation  Pushdown automata  Competence  Computer Science Applications  Team automata  Applied Mathematics  Accepting capacity 

We introduce team pushdown automata (PDAs) as a theoretical framework capable of modelling various communication and cooperation strategies in complex, distributed systems. Team PDAs are obtained by augmenting distributed PDAs with the notion of team cooperation or, alternatively, by augmenting team automata with pushdown memory. In a team PDA, several PDAs work as a team on the input word placed on a common one-way input tape. At any moment in time one team of PDAs, each with the same symbol on top of its stack, is active: each PDA in the active team replaces the topmost symbol of its stack and changes state, while the current input symbol is read from the input tape by a common reading head. The teams are formed according to the team cooperation strategy of the team PDA and may vary from one moment to the other. Based on the notion of competence, we introduce a variety of team cooperation strategies. If all stacks are empty when the input word has been completely read, then this word is part of the language accepted by the team PDA. Here we focus on the accepting capacity of team PDA.

Source: International Journal of Computer Mathematics 81 (2004): 141–156. doi:10.1080/00207160310001650099

Publisher: Taylor & Francis,, London , Regno Unito

Metrics