Skip to main content

Abstract

This paper is a direct continuation of [11]. Characterizations of recursively enumerable languages are given, by means of splicing P systems, having splicing rules of small size (that is, involving short context strings). Also it is shown that with only two membranes we can generate all the recursively enumerable languages; this improves a result from [11], where three membranes are used.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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. Culik II, K. & T. Harju (1991), Splicing semigroups of dominoes and DNA, Discrete Applied Mathematics, 31: 261–277.

    Article  MathSciNet  MATH  Google Scholar 

  2. Dassow, J. & Gh. Păun (1999), On the power of membrane computing, Journal of Universal Computer Science, 5.2: 33–49 (http://www.iicm.edu/jucs).

    MathSciNet  Google Scholar 

  3. Head, T. (1987), Formal language theory andDNA: ananalysisof the generative capacity of specific recombinant behaviors, Bulletin of Mathematical Biology, 49: 737–759.

    MathSciNet  MATH  Google Scholar 

  4. Păun, A. (1997), Controlled H systems of small radius, Fundamenta Informaticae, 31.2: 185–193.

    MathSciNet  MATH  Google Scholar 

  5. Păun, A. & M. Păun (1998), Controlled and distributed H systems of a small diameter, in Gh. Păun, ed., Computing with Bio-Molecules: Theory and Experiments, Springer, Singapore.

    Google Scholar 

  6. Păun, Gh. (1996), Regular extended H systems are computationally universal, Journal of Automata, Languages and Combinatorics, 1.1: 27–36.

    MathSciNet  MATH  Google Scholar 

  7. Păun, Gh. (1998), Computing with membranes, Journal of Computer and System Sciences, to appear. (See also TUCS Research Reports, No. 208, November 1998, http://www.tucs.fi)

  8. Păun, Gh. (1999), Computing with membranes. An introduction, Bulletin of the European Association for Theoretical Computer Science, 67: 139–152.

    MATH  Google Scholar 

  9. Păun, Gh.; G. Rozenberg & A. Salomaa (1998), DNA Computing. New Computing Paradigms, Springer, Berlin.

    Book  MATH  Google Scholar 

  10. Păun, Gh.; G. Rozenberg & A. Salomaa (1999), Membrane computing with external output, submitted. (See also TUCS Research Reports, No. 218, December 1998, http://www.tucs.fi

  11. Păun, Gh. & T. Yokomori (1999), Membrane Computing Based on Splicing, in E. Winfree & D. Gifford, eds., Preliminary Proceedings of the Fifth International Meeting on DNA Based Computers: 213-227. MIT Press, Cambridge, Mass.

    Google Scholar 

  12. Păun, Gh. & S. Yu (1999), On synchronization in P systems, Fundamenta Informaticae, 38.4: 397–10.

    MathSciNet  MATH  Google Scholar 

  13. Pixton, D. (1996), Regularity of splicing languages, Discrete Applied Mathematics, 69: 101–124.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Păun, A., Păun, M. (2001). On Membrane Computing Based on Splicing. In: Martín-Vide, C., Mitrana, V. (eds) Where Mathematics, Computer Science, Linguistics and Biology Meet. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9634-3_36

Download citation

  • DOI: https://doi.org/10.1007/978-94-015-9634-3_36

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-5607-8

  • Online ISBN: 978-94-015-9634-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics