Skip to main content
SpringerLink
Log in

On the Computational Complexity of P Automata

  • Conference paper
DNA Computing (DNA 2004)

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

Included in the following conference series:

Abstract

We characterize the classes of languages described by P automata, i.e., accepting P systems with communication rules only. Motivated by properties of natural computing systems, we study computational complexity classes with a certain restriction on the use of the available workspace in the course of computations and relate these to the language classes described by P automata. We prove that if the rules of the P system are applied sequentially, then the accepted language class is strictly included in the class of languages accepted by one-way Turing machines with a logarithmically bounded workspace, and if the rules are applied in the maximal parallel manner, then the class of context-sensitive languages is obtained.

The research of E. Csuhaj-Varjú and Gy. Vaszil was supported in part by the Hungarian Scientific Research Fund “OTKA” grant no. T 042529. The research of O. H. Ibarra was supported in part by NSF Grants IIS-0101134 and CCR02-08595.

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. Csuhaj-Varjú, E., Vaszil, G.: P Automata. In: Păun, G., et al. (eds.) WMC 2002. LNCS, vol. 2597, pp. 219–233. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Fischer, P.C.: Turing Machines with Restricted Memory Access. Information and Control 9, 364–379 (1966)

    Article  MATH  MathSciNet  Google Scholar 

  3. Freund, R., Martín-Vide, C., Obtułowicz, A., Păun, G.: On Three Classes of Automata-like P Systems. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 292–303. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Freund, R., Oswald, M.: A Short Note on Analysing P Systems. Bulletin of the EATCS 78, 231–236 (2002)

    MATH  MathSciNet  Google Scholar 

  5. Ibarra, O.H.: On the Computational Complexity of Membrane Systems. Theoretical Computer Science C (to appear)

    Google Scholar 

  6. Ibarra, O.H.: The Number of Membranes Matters. In: Alhazov, A., Martín-Vide, C., Păun, Gh. (eds.): Workshop on Membrane Computing, WMC-2003, Tarragona, July 17-22, Technical Report 28/03 of the Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain, 273-285 (2003)

    Google Scholar 

  7. Madhu, M., Krithivasan, K.: On a Class of P Automata (submitted)

    Google Scholar 

  8. Martín-Vide, C., Păun, A., Păun, G.: On the Power of P Systems with Symport Rules. Journal of Universal Computer Science 8(2), 317–331 (2002)

    MathSciNet  Google Scholar 

  9. Păun, A., Păun, G.: The Power of Communication: P Systems with Symport/Antiport. New Generation Computing 20(3), 295–306 (2002)

    Article  MATH  Google Scholar 

  10. Păun, G.: Computing with Membranes: An Introduction. Springer, Berlin (2002)

    Google Scholar 

  11. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 1-3. Springer, Berlin (1997)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

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

  2. Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA

    Oscar H. Ibarra

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

    You can also search for this author in PubMed Google Scholar

  2. Oscar H. Ibarra
    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. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano – Bicocca, Via Bicocca degli Arcimboldi 8, 20126, Milano, Italy

    Claudio Ferretti  & Claudio Zandron  & 

  2. Complex Systems and Artificial Intelligence Research Center, University of Milan–Bicocca, Italy

    Giancarlo Mauri

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Csuhaj-Varjú, E., Ibarra, O.H., Vaszil, G. (2005). On the Computational Complexity of P Automata. In: Ferretti, C., Mauri, G., Zandron, C. (eds) DNA Computing. DNA 2004. Lecture Notes in Computer Science, vol 3384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11493785_7

Download citation

  • DOI: https://doi.org/10.1007/11493785_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26174-2

  • Online ISBN: 978-3-540-31844-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation