Skip to main content
SpringerLink
Log in

Boolean Circuits and a DNA Algorithm in Membrane Computing

  • Conference paper
Book cover Membrane Computing (WMC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3850))

Included in the following conference series:

Abstract

In the present paper we propose a way to simulate Boolean gates and circuits in the framework of P systems with active membranes using inhibiting/de-inhibiting rules. This new approach on the simulation of Boolean gates has the advantage of a self-embedded synchronization, an extra system to solve this problem not being needed. Moreover, the number of membranes and objects we use for the simulation of Boolean gates is only two. NP-complete problems, particularly CIRCUIT-SAT, are also considered here. In addition, we simulate a ‘DNA-like’ way of (experimentally) solving SAT problem using the tools given by polarization, merging, and separation in P systems.

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. Alhazov, A., Ishdorj, T.-O.: Membrane operations in P systems with active membranes. In: Păun, G., Riscos-Núñez, A., Romero-Jiménez, A., Sancho-Caparrini, F. (eds.) Second Brainstorming Week on Membrane Computing. Technical report of Research Group on Natural Computing, University of Seville, TR 01/2004, pp. 37–44

    Google Scholar 

  2. Alhazov, A., Pan, L., Păun, G.: Trading polarizations for labels in P systems with active membranes. Acta Informatica 41(2-3), 111–144 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  3. Alhazov, A., Pan, L.: Polarizationless P systems with active membranes. Grammars 7, 141–159 (2004)

    Google Scholar 

  4. Braich, R.S., Chelyapov, N., Johnson, C., Rothemund, R.W.K., Adleman, L.: Solution to a 20-variable 3-SAT problem on a DNA computer. Science 296(5567), 499–502 (2002)

    Article  Google Scholar 

  5. Calude, C., Păun, G., Rozenberg, G., Salomaa, A. (eds.): Multiset Processing. LNCS, vol. 2235. Springer, Heidelberg (2001)

    Google Scholar 

  6. Cavaliere, M., Ionescu, M., Ishdorj, T.-O.: Inhibiting/de-inhibiting rules in P systems. In: Mauri, G., Păun, G., Jesús Pérez-Jímenez, M., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 224–238. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. Cavaliere, M., Ionescu, M., Ishdorj, T.-O.: Inhibiting/de-inhibiting P systems with active membranes. In: Cellular Computing (Complexity Aspects), ESP PESC Exploratory Workshop, Sevilla, pp. 117–130 (2005)

    Google Scholar 

  8. Ceterchi, R., Sburlan, D.: Simulating Boolean circuits with P systems. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2003. LNCS, vol. 2933, pp. 104–122. Springer, Heidelberg (2004)

    Google Scholar 

  9. Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)

    MATH  Google Scholar 

  10. Garey, M.R., Johnson, D.J.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman WH, San Francisco (1979)

    MATH  Google Scholar 

  11. Head, T.: Aqueous simulations of membrane computations. Romanian Journal of Information Science and Technology 5 (2002)

    Google Scholar 

  12. Ionescu, M., Ishdorj, T.-O.: Replicative–distributed rules in P systems with active membranes. In: Proceedings of First International Colloquium on Theoretical Aspects of Computing, UNU/IIST Report No. 310, Guiyang, China, September 20-24, 2004, pp. 263–278 (2004); LNCS vol. 4705, pp. 69–84. Springer, Berlin (2005)

    Google Scholar 

  13. Lipton, R.J.: Using DNA to solve NP-complete problems. Science 268, 542–545 (1995)

    Article  Google Scholar 

  14. Pan, L., Alhazov, A., Ishdorj, T.-O.: Further remarks on P systems with active membranes, separation, merging and release rules. Soft Computing 9(9), 686–690 (2005)

    Article  MATH  Google Scholar 

  15. Pan, L., Ishdorj, T.-O.: P systems with active membranes and separation rules. Journal of Universal Computer Science 10(5), 630–649 (2004)

    MathSciNet  Google Scholar 

  16. Pan, L., Alhazov, A.: Solving HPP and SAT by P systems with active membranes and separation rules (2005) (Submitted)

    Google Scholar 

  17. Papadimitriou, C.P.: Computational Complexity. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  18. Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000); TUCS Research Report 208 (1998)

    Google Scholar 

  19. Păun, G.: P systems with active membranes: Attacking NP-complete problems. Journal of Automata, Languages and Combinatorics 6(1), 75–90 (2001)

    MATH  MathSciNet  Google Scholar 

  20. Păun, G.: Membrane Computing: An Introduction. Springer, Berlin (2002)

    Google Scholar 

  21. Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing. New Computing Paradigms. Springer, Berlin (1998)

    MATH  Google Scholar 

  22. Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F.: Complexity classes in models of cellular computation with membranes. Natural Computing 2(3), 265–285 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  23. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)

    MATH  Google Scholar 

  24. Sakamoto, K., Gounzu, H., Komiya, K., Kiga, D., Yokoyama, S., Yokomori, T., Hagiya, M.: Molecular computation by DNA hairpin formation. Science 288, 1223–1226 (2000)

    Article  Google Scholar 

  25. Salomaa, A.: Formal Languages. Academic Press, New York (1973)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Group on Mathematical Linguistics, Pl. Imperial Tàrraco 1, 43005, Tarragona, Spain

    Mihai Ionescu & Tseren-Onolt Ishdorj

Authors
  1. Mihai Ionescu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tseren-Onolt Ishdorj
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Informatics, Vienna University of Technology, Favoritenstr. 9, 1040, Vienna, Austria

    Rudolf Freund

  2. Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700, Bucureşti, Romania

    Gheorghe Păun

  3. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

  4. Turku Centre for Computer Science (TUCS), Leminkäisenkatu 14, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ionescu, M., Ishdorj, TO. (2006). Boolean Circuits and a DNA Algorithm in Membrane Computing. In: Freund, R., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2005. Lecture Notes in Computer Science, vol 3850. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11603047_19

Download citation

  • DOI: https://doi.org/10.1007/11603047_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30948-2

  • Online ISBN: 978-3-540-32340-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation