Skip to main content

On P Systems with Global Rules

  • Conference paper
  • First Online:
DNA Computing (DNA 2001)

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

Included in the following conference series:

  • 635 Accesses

Abstract

We contribute to the vivid area of membrane computing (P systems) by considering the case when the same evolution rules are valid in all regions of a system. Such a P system is called with global rules. We consider the case of string-objects, with the evolution rules based on splicing and by rewriting. Universality results are proved for both types of systems. For splicing we also try to minimize the diameter of the used rules, while for rewriting systems we improve a result from the literature, proving that two membrane suffice for simulating Turing machines.

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

Access this chapter

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. J. Dassow, Gh. Păun, Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, 1989.

    Google Scholar 

  2. P. Frisco, Membrane computing based on splicing: improvements, Pre-proc. Workshop on Multiset Processing, Curtea de Argeş, Romania, TR 140, CDMTCS, Univ. Auckland, 2000, 100–111.

    Google Scholar 

  3. T. Head, Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors, Bull. Math. Biology, 49 (1987), 737–759.

    MATH  MathSciNet  Google Scholar 

  4. T. Head, Aqueous computations as membrane computations, submitted, 2001.

    Google Scholar 

  5. A. Păun, Controlled H systems of small radius, Fundamenta Informaticae, 31,2 (1997), 185–193.

    MathSciNet  MATH  Google Scholar 

  6. A. Păun, M. Păun, On the membrane computing based on splicing, Where Mathematics, Computer Science, Linguistics and Biology Meet (C. Martin-Vide, V. Mitrana, Eds.), Kluwer, Dordrecht, 2001, 409–422.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  8. Gh. Păun, Computing with membranes (P systems): Twenty six research topics, Auckland University, CDMTCS Report No 119, 2000 (www.cs.auckland.ac.nz/CDMTCS).

  9. Gh. Păun, T. Yokomori, Membrane Computing Based on Splicing, Preliminary Proc. of Fifth Intern. Meeting on DNA Based Computers (E. Winfree, D. Gifford, eds.), MIT, June 1999, 213–227.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Păun, A. (2002). On P Systems with Global Rules. In: Jonoska, N., Seeman, N.C. (eds) DNA Computing. DNA 2001. Lecture Notes in Computer Science, vol 2340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48017-X_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-48017-X_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43775-8

  • Online ISBN: 978-3-540-48017-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics