Skip to main content
SpringerLink
Log in

P Automata or Purely Communicating Accepting P Systems

  • Conference paper
  • First Online:
Book cover Membrane Computing (WMC 2002)

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

Included in the following conference series:

Abstract

In this paper we introduce the notion of a P automaton with one-way communication, a concept related both to Psystems and the traditional concept of automata. A P automaton with one-way communication is a purely communicating accepting Psystem. The result of the computation in these systems is the set of multiset sequences consumed by the skin membrane, supposing that the P automaton started functioning in an initial state and entered a so-called final state. As a result, we show that for any recursively enumerable language, a P automaton and a certain type of projection can be constructed such that the given language is obtained as the image of the set of accepted input multiset sequences of the Pautomaton.

Research supported in part by the Hungarian Scientific Research Fund “OTKA” grants no. T 029615, F 037567, and by the MolCoNet project, IST-2001-32008.

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. Fischer, P. C.: Turing machines with restricted memory access. Information and Control 9 (1966) 364–379.

    Article  MathSciNet  MATH  Google Scholar 

  2. Hopcroft, J. E., Ullman, J. D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, Mass., 1979.

    Google Scholar 

  3. Martín-Vide, C., Păun, A., Păaun, Gh.: On the power of Psystems with symport rules. Journal of Universal Computer Science 8(2) (2002) 317–331.

    MathSciNet  Google Scholar 

  4. Păun, Gh.: Computing with membranes. TUCS Report 208, Turku Centre for Computer Science, 1998.

    Google Scholar 

  5. Păun, Gh.: Computing with membranes. An introduction. Bulletin of the EATCS 67 (1999) 139–152.

    MATH  Google Scholar 

  6. Păun, Gh.: Computing with membranes. Journal of Computer and System Sciences 61(1) (2000) 108–143.

    Article  MathSciNet  MATH  Google Scholar 

  7. Păun, Gh.: Computing with membranes (PSystems): Twenty six research topics. CDMTCS Technical Report 119, Univ. of Auckland, 2000.

    Google Scholar 

  8. Păun, Gh.: Membrane Computing. An Introduction. Springer-Verlag, Berlin, 2002.

    Google Scholar 

  9. Păun, Gh., Rozenberg, G.: A guide to membrane computing. Theoretical Computer Science 287 (2002) 73–100.

    Article  MathSciNet  MATH  Google Scholar 

  10. Rozenberg, G., Salomaa, A., eds.: Handbook of Formal Languages. Volumes I–III. Springer-Verlag, 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

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

    You can also search for this author in PubMed Google Scholar

  2. György Vaszil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics of the Romanian Academy, P.O. Box 1-764, 70700, Bucharest, Romania

    Gheorghe PĂun

  2. Leiden University, Leiden Institute of Advanced Computer Science, Niels Bohrweg 1, 2333, CA Leiden, The Netherlands

    Grzegorz Rozenberg

  3. Turku Centre for Computer Science, Lemminkäisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

  4. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Via Bicocca degli Arcimboldi, 8, 20126, Milano, Italy

    Claudio Zandron

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Csuhaj-Varjú, E., Vaszil, G. (2003). P Automata or Purely Communicating Accepting P Systems. In: PĂun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds) Membrane Computing. WMC 2002. Lecture Notes in Computer Science, vol 2597. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36490-0_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-36490-0_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00611-4

  • Online ISBN: 978-3-540-36490-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation