Teams of pushdown automata

Maurice H. Ter Beek, Erzsébet Csuhaj-Varjú, Victor Mitrana

Research output: Chapter in Book/Report/Conference proceedingChapter

1 Citation (Scopus)

Abstract

We introduce team pushdown automata as a theoretical framework capable of modelling various communication and cooperation strategies in complex, distributed systems. Team pushdown automata are obtained by augmenting distributed pushdown automata with the notion of team cooperation or - alternatively - by augmenting team automata with pushdown memory. Here we study their accepting capacity.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsAlexandre V. Zamulin, Manfred Broy
PublisherSpringer Verlag
Pages329-337
Number of pages9
ISBN (Print)3540208135
Publication statusPublished - Jan 1 2003

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2890
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Teams of pushdown automata'. Together they form a unique fingerprint.

  • Cite this

    Ter Beek, M. H., Csuhaj-Varjú, E., & Mitrana, V. (2003). Teams of pushdown automata. In A. V. Zamulin, & M. Broy (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 329-337). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2890). Springer Verlag.