Skip to main content
SpringerLink
Log in

Asynchronous PC Systems of Pushdown Automata

  • Conference paper
Language and Automata Theory and Applications (LATA 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7810))

Abstract

We introduce asynchronous variants of the PC systems of pushdown automata of Csuhaj-Varjú et. al. These are obtained by using a response symbol in addition to the usual query symbols. Our main result states that centralized asynchronous PC systems of pushdown automata of degree n that work in returning mode have exactly the same expressive power as n-head pushdown automata. This holds in the nondeterministic as well as in the deterministic case.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Balan, M.: Serializing the parallelism in parallel communicating pushdown automata systems. In: Dassow, J., Pighizzini, G., Truthe, B. (eds.) DCFS 2009. Electronic Proceedings in Theoretical Computer Science, vol. 3, pp. 59–68 (2009)

    Google Scholar 

  2. Buntrock, G., Otto, F.: Growing context-sensitive languages and Church-Rosser languages. Inform. and Comput. 141, 1–36 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chrobak, M.: Hierarchies of one-way multihead automata languages. Theor. Comput. Sci. 48, 153–181 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chrobak, M., Li, M.: k + 1 heads are better than k for PDAs. J. Comp. Syst. Sci. 37, 144–155 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  5. Csuhaj-Varjú, E., Dassow, J., Kelemen, J., Păun, G.: Grammar Systems - A Grammatical Approach to Distribution and Cooperation. Gordon and Breach, London (1994)

    MATH  Google Scholar 

  6. Csuhaj-Varjú, E., Martín-Vide, C., Mitrana, V., Vaszil, G.: Parallel communicating pushdown automata systems. Intern. J. Found. Comput. Sci. 11, 631–650 (2000)

    Article  Google Scholar 

  7. Dassow, J., Păun, G., Rozenberg, G.: Grammar systems. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Linear Modelling: Background and Applications, vol. 2, pp. 101–154. Springer, Heidelberg (1997)

    Google Scholar 

  8. Otto, F.: Centralized PC Systems of Pushdown Automata versus Multi-head Pushdown Automata. In: Kutrib, M., Moreira, N., Reis, R. (eds.) DCFS 2012. LNCS, vol. 7386, pp. 244–251. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  9. Petersen, H.: The power of centralized PC systems of pushdown automata. arXiv:1208.1283 (2012)

    Google Scholar 

  10. Vollweiler, M., Otto, F.: Systems of parallel communicating restarting automata. In: Freund, R., Holzer, M., Truthe, B., Ultes-Nitsche, U. (eds.) Fourth Workshop on Non-Classical Models for Automata and Applications (NCMA 2012). Proc., books@ocg.at, vol. 290, pp. 197–212. Oesterreichische Computer Gesellschaft, Wien (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Elektrotechnik/Informatik, Universität Kassel, 34109, Kassel, Germany

    Friedrich Otto

Authors
  1. Friedrich Otto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Avinguda Catalunya, 35, 43002, Tarragona, Spain

    Adrian-Horia Dediu  & Carlos Martín-Vide  & 

  2. Fakultät für Informatik, Institut für Wissens- und Sprachverarbeitung, Otto-von-Guericke-Universität Magdeburg, Universitätsplatz 2, 39106, Magdeburg, Germany

    Bianca Truthe

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Otto, F. (2013). Asynchronous PC Systems of Pushdown Automata. In: Dediu, AH., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2013. Lecture Notes in Computer Science, vol 7810. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37064-9_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-37064-9_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-37063-2

  • Online ISBN: 978-3-642-37064-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation