Skip to main content
SpringerLink
Log in
Book cover

Workshop on Membrane Computing

WMC 2002: Membrane Computing pp 302–318Cite as

Towards a Hierarchy of Conformons – P Systems

  • Conference paper
  • First Online:

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

Abstract

The combination ofa theoretical model ofthe living cell and membrane computing suggested a new variant ofa computational model called conformons-P system based on membrane-enclosed compartments where conformon-like objects evolve. Some variants of such model are presented and their computational power is sketched.

Work partially supported by contribution ofEU commission under The Fifth Framework Programme, project “MolCoNet” IST-2001-32008

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B.S. Baker and R.V. Book. Reversal-bounded multipushdown machines. Journal of computer and system science, 8:315–332, 1974.

    Article  MathSciNet  MATH  Google Scholar 

  2. J. Castellanos, G. Păun, and A. Rodriguez-Paton. P systems with worm objects. In IEEE 7th. Intern. Conf. on String Processing and Information Retrieval, SPIRE 2000, La Coruna, Spain, pages 64–74, 2000. See also CDMTCS TR 123, Univ. of Auckland, 2000 (http://www.cs.auckland.ac.nz/CDMTCS).

  3. P. Frisco and S. Ji. About conformons-P systems, 2002. (manuscript in preparation).

    Google Scholar 

  4. P. Frisco and S. Ji. Conformons-P systems. In DNA Computing, 8th international Workshop on DNA-Based Computers, DNA 2002, Sapporo, Japan, 10–13 June 2002, pages 161–170. Hokkaido University, 2002.

    Google Scholar 

  5. S.A. Greibach. Remarks on blind and partially blind one-way multicounter machines. Theoretical Computer Science, 7:311–324, 1978.

    Article  MathSciNet  MATH  Google Scholar 

  6. T. Head. Formal language theory and DNA: an analysis ofthe generative capacity ofsp ecific recombinant behaviors. Bulletin of Mathematical Biology, 49(6):737–759, 1987.

    MathSciNet  MATH  Google Scholar 

  7. H.J. Hoogeboom. Carriers and counters. P-systems with carriers vs. (blind) counter automata. Developments in Language Theory, DLT2002, pages 255–268, 2002.

    Google Scholar 

  8. S. Ji. A general theory ofA TP synthesis and utilization. Ann. N.Y. Acad. Sci., 227:211–226, 1974.

    Article  Google Scholar 

  9. S. Ji. The Bhopalator: a molecular model ofthe living cell based on the concepts ofconf ormons and dissipative structures. J. theoret. Biol., 116:395–426, 1985.

    Article  Google Scholar 

  10. S. Ji. Biocybernetics: a machine theory of biology, pages 1–237. Molecular theories and cell life and death. Rutgers University Press, New Brunswick, 1991. S. Ji, ed.

    Google Scholar 

  11. S. Ji. The cell as the smallest DNA-based molecular computer. BioSystems, 52:123–133, 1999.

    Article  Google Scholar 

  12. S. Ji. Free energy and information contents of conformons in proteins and DNA. BioSystems, 54:107–214, 2000.

    Article  Google Scholar 

  13. S. Ji. The Bhopalator: an information/energy dual model of the living cell (II). Fundamenta Informaticae, 49(1–3):147–165, 2002.

    MATH  Google Scholar 

  14. S. Ji and G. Ciobanu. Conformons and biopolymers shape change in cell modelling. accepted in BioSystems, 2002.

    Google Scholar 

  15. J.P. Jones and Y.V. Matijasevič. Register machine proofofthe theorem on exponential Diophantine representation ofen umerable sets. Journal of Symbolic Logic, 49(3):818–829, September 1984.

    Article  MathSciNet  MATH  Google Scholar 

  16. M. Madhu and K. Krithivasan. P systems with active objects: Universality and efficiency. MCU, Chisinau, Moldova, Proceedings in LNCS 2055, pages 276–287, 2001. M. Margenstern and Y. Rogozhin, editors.

    Google Scholar 

  17. C. Martin-Vide and V. Mitrana. P systems with valuations. In I. Antoniou, C.S. Calude, and M.J. Dinneen, editors, Unconventional Models of Computation, UMC’2K, Solvay Institutes, Brussel, 13–16 December 2000, DIMACS: Series in Discrete Mathematics and Theoretical Computer Science., pages 154–166. Springer Verlag, Berlin, Heidelberg, New York., 2000.

    Google Scholar 

  18. M.L. Minsky. Recursive unsolvability of Post’s problem of“tag” and other topics in theory ofT uring machines.Annals of Mathematics, 74(3):437–455, November 1961.

    Article  MathSciNet  MATH  Google Scholar 

  19. M.L. Minsky. Computation: Finite and Infinite Machines. Automatic Computation. Prentice-Hall, 1967.

    Google Scholar 

  20. A. Păun, G. Păun, and G. Rozenberg. Computing by communication in networks ofmem branes. to appear in Intern. J. ofF oundations ofComputer Science, 2001.

    Google Scholar 

  21. G. Păun. Computing with membranes. Journal of Computer and System Sciences, 1(61):108–143, 2000. See also Turku Centre for Computer Science-TUCS Report No. 208, 1998 http://www.tucs.fi.

    Article  Google Scholar 

  22. G. Păun. Computing with membranes. a variant: P systems with polarized membranes. Inter. J. of Foundations of Computer Science, 1(11):167–182, 2000.

    Article  Google Scholar 

  23. G. Păun. P systems with active membranes: attacking NP complete problems. J. Automata, Languages and Combinatorics, 1(6):75–90, 2001.

    Google Scholar 

  24. G. IPăun and T. Yokomori. Membrane computing based on splicing. In Erik Winfree and David K. Gifford, editors, Proceedings 5th DIMACS Workshop on DNA Based Computers, held at the Massachusetts Institute of Technology, Cambridge, MA, USA June 14-June 15, 1999, pages 217–232. American Mathematical Society, 1999.

    Google Scholar 

  25. W. Reisig and G. Rozenberg, editors. Lectures on Petri Nets I: Basic Models, volume 1491 of LNCS. Springer Verlag, Berlin, Heidelberg, New York., 1998.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. L.I.A.C.S., Leiden University, Niels Bohwerg 1, 2333, Leiden, CA, The Netherlands

    Pierluigi Frisco

  2. Dep. ofPharm. and Toxic, Rutgers University, 08855, Piscataway, NJ, USA

    Sungchul Ji

Authors
  1. Pierluigi Frisco
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sungchul Ji
    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

Frisco, P., Ji, S. (2003). Towards a Hierarchy of Conformons – 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_20

Download citation

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

  • 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