Skip to main content
SpringerLink
Log in

Centralized PC Systems of Pushdown Automata versus Multi-head Pushdown Automata

  • Conference paper
Descriptional Complexity of Formal Systems (DCFS 2012)

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

Included in the following conference series:

Abstract

In returning mode centralized PC systems of pushdown automata of degree n can simulate n-head pushdown automata (Csuhaj-Varjú et. al. 2000). At DCFS 2009, Balan claimed that also the converse holds. Here we show that Balan’s proof of this claim is not correct. Accordingly it is still open whether n-head pushdown automata and centralized PC systems of pushdown automata of degree n working in returning mode accept the same class of languages.

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.) 11th International Workshop on Descriptional Complexity of Formal Systems (DCFS 2009). Electronic Proceedings in Theoretical Computer Science, vol. 3, pp. 59–68 (2009), doi:10.4204/EPTCS.3.5

    Google Scholar 

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

    Google Scholar 

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

    Article  Google Scholar 

  4. 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 

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. Institut für Informatik, Universität Giessen, Arndtstraße 2, 35392, Giessen, Germany

    Martin Kutrib

  2. Departamento de Ciência de Computadores, Universidade do Porto, Faculdade de Ciências, Rua do Campo Alegre 1021-1055, 4169-007, Porto, Portugal

    Nelma Moreira  & Rogério Reis  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Otto, F. (2012). Centralized PC Systems of Pushdown Automata versus Multi-head Pushdown Automata. In: Kutrib, M., Moreira, N., Reis, R. (eds) Descriptional Complexity of Formal Systems. DCFS 2012. Lecture Notes in Computer Science, vol 7386. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31623-4_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31623-4_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31622-7

  • Online ISBN: 978-3-642-31623-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation