Skip to main content
Springer Nature Link
Log in

Distributed Pushdown Automata Systems: Computational Power

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2710))

Included in the following conference series:

  • 422 Accesses

Abstract

We introduce distributed pushdown automata systems consisting of several pushdown automata which work in turn on the input string placed on a common one-way input tape. The work of the components is based on protocols and strategies similar to those that cooperating distributed grammar systems use. We investigate the computational power of these mechanisms under different protocols for activating components and two ways of accepting the input string: with empty stacks or with final states which means that all components have empty stacks or are in final states, respectively, when the input string was completely read.

Work supported in part by a grant from the NATO Scientific Committee in Spain

Work supported by the Centre of Excellence in Information Technology, Computer Science and Control, ICA1-CT-2000-70025, HUN-TING project, WP5.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. M.H. ter Beek, E. Csuhaj-Varjú, V. Mitrana, Teams of pushdown automata, submitted.

    Google Scholar 

  2. E. Csuhaj-Varjú, J. Dassow, On cooperating distributed grammar systems, J. Inform. Process. Cybern., EIK, 26 (1990), 49–63.

    MATH  Google Scholar 

  3. E. Csuhaj-Varjú, J. Dassow, J. Kelemen, Gh. Päun, Grammar Systems. A grammatical approach to distribution and cooperation, Gordon and Breach, 1994.

    Google Scholar 

  4. E. Csuhaj-Varjú, C. Martín-Vide, V. Mitrana, Gy. Vaszil, Parallel communicating pushdown automata systems, Intern. J. Found. Comp. Sci., 11:4 (2000), 633–650.

    MATH  Google Scholar 

  5. J. Dassow, Gh. Pâaun, G. Rozenberg, Grammar systems, in vol. 2 of [12].

    Google Scholar 

  6. J. Dassow, V. Mitrana, “Stack cooperation in multi-stack pushdown automata”, J. Comput. System Sci. 58 (1999), 611–621.

    Article  MATH  MathSciNet  Google Scholar 

  7. O. H. Ibarra, One two-way multihead automata, J. Comput. System Sci. 7 (1973), 28–36.

    MATH  MathSciNet  Google Scholar 

  8. C. Martín-Vide, V. Mitrana, Some undecidable problems for parallel communicating finite automata systems, Inform. Proc. Letters, 77:5–6 (2001), 239–245.

    Article  MATH  Google Scholar 

  9. C. Martín-Vide, V. Mitrana, Parallel communicating automata systems. A survey. Invited article in Korean Journal of Computational and Applied Mathematics, 7:2 (2000), 237–257.

    MATH  Google Scholar 

  10. C. Martín-Vide, A. Mateescu, V. Mitrana, Parallel finite automata systems communicating by states, Intern. J. Found. Comp. Sci., 13:5 (2002), 733–749.

    Article  MATH  Google Scholar 

  11. Gh. Pâun, L. Sântean, Parallel communicating grammar systems: the regular case, Ann. Univ. Bucharest, Ser. Matem.-Inform. 38 (1989), 55–63.

    MATH  Google Scholar 

  12. G. Rozenberg, A. Salomaa, Handbook of Formal Languages, Springer-Verlag, Berlin, vol. 1–3, 1997.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer and Automation Research Institute, Hungarian Academy of Sciences, Kende u. 13-17, 1111, Budapest, Hungary

    Erzsébet Csuhaj-Varjú & György Vaszil

  2. Faculty of Mathematics and Computer Science, University of Bucharest, Str. Academiei 14, 70109, Bucharest, Romania

    Victor Mitrana

  3. Research Group in Mathematical Linguistics, Rovira i Virgili University, Pça. Imperial Tàrraco 1, 43005, Tarragona, Spain

    Victor Mitrana

Authors
  1. Erzsébet Csuhaj-Varjú
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Victor Mitrana
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. György Vaszil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Szeged, Árpád tér 2, 6720, Szeged, Hungary

    Zoltán Ésik  & Zoltán Fülöp  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Csuhaj-Varjú, E., Mitrana, V., Vaszil, G. (2003). Distributed Pushdown Automata Systems: Computational Power. In: Ésik, Z., Fülöp, Z. (eds) Developments in Language Theory. DLT 2003. Lecture Notes in Computer Science, vol 2710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45007-6_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-45007-6_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40434-7

  • Online ISBN: 978-3-540-45007-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics