Skip to main content

Insertion-Deletion P Systems

  • 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:

Abstract

New computability models, called P systems, based on the evolution of objects in a membrane structure were recently introduced. This paper presents a new variant of P systems with string objects having insertion-deletion rules as the control structure. The use of this control structure is motivated from the DNA Computing area where insertions and deletions of small strands of DNA happen frequently in all types of cells and constitute also one of the methods used by some viri to infect a host. We investigate here the power of this type of systems with less than four membranes, in comparison with the families of CF, MAT and RE.

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. C.S. Calude and Gh. Păun, Computing with Cells and Atoms-An Introduction to Quantum, DNA and Membrane Computing, Taylor & Francis, London, 2001.

    MATH  Google Scholar 

  2. L. Kari, G. Paun, G. Thierrin, and S. Yu, At the crossroads of DNA computing and formal languages: characterizing recursively enumerable languages by insertiondeletion systems, DNA Based Computers III, H. Rubin and D. Wood, eds.

    Google Scholar 

  3. L. Kari and G. Thierrin, Contextual insertions/deletions and computability, Information and Computation, 131, pp. 47–61, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  4. Gh. Păun, Computing with membranes, Journal of Computer and System Sciences, 61,1 (2000), 108–143 (see also Turku Center for Computer Science-TUCS Report No. 208, 1998, www.tucs.fi).

    Article  MathSciNet  MATH  Google Scholar 

  5. Gh. Păun, G. Rozenberg, A. Salomaa, DNA Computing-New Computing Paradigms, Springer-Verlag, Berlin, 1998.

    MATH  Google Scholar 

  6. G. Rozenberg, A. Salomaa, eds., Handbook of Formal Languages, 3 volumes, Springer-Verlag, Berlin, 1997.

    MATH  Google Scholar 

  7. http://bioinformatics.bio.disco.unimib.it/psystems/

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

Krishna, S.N., Rama, R. (2002). Insertion-Deletion P Systems. 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_34

Download citation

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

  • 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