[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Minimal Parallelism for Polarizationless P Systems

  • Conference paper
DNA Computing (DNA 2006)

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

Included in the following conference series:

  • 748 Accesses

Abstract

Minimal parallelism was recently introduced [3] as a way the rules of a P system are used: from each set of applicable rules associated to the same membrane, at least one must be applied. In this paper, we consider the minimal parallelism for P systems with active membranes without polarizations, using additional features, such as separation operations, changing membrane labels, catalytic or cooperative rules, etc. With several combinations of such features we obtain computational completeness. In cases where membrane division (of elementary or non-elementary membranes) is allowed, we show how SAT can be solved in polynomial time.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Alhazov, A., Ishdorj, T.-O.: Membrane Operations in P Systems with Active Membranes. In: Păun, G., et al. (eds.) Second Brainstorming Week on Membrane Computing, Sevilla, TR 01/2004, University of Sevilla, February 2-7, pp. 37–44 (2004)

    Google Scholar 

  2. Alhazov, A., Pan, L., Păun, G.: Trading Polarizations for Labels in P Systems with Active Membranes. Acta Informaticae 41(2-3), 111–144 (2004)

    Article  MATH  Google Scholar 

  3. Ciobanu, G., Pan, L., Păun, G., Pérez-Jiménez, M.J.: P Systems with Minimal Parallelism (submitted, 2005)

    Google Scholar 

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

    Google Scholar 

  5. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  6. Minsky, M.L.: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs (1967)

    MATH  Google Scholar 

  7. Pan, L., Alhazov, A., Ishdorj, T.-O.: Further Remarks on P Systems with Active Membranes, Separation, Merging and Release Rules. Soft Computing 8, 1–5 (2004)

    Google Scholar 

  8. 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 

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

    MATH  Google Scholar 

  10. 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 

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

    MATH  Google Scholar 

  12. 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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ishdorj, TO. (2006). Minimal Parallelism for Polarizationless P Systems. In: Mao, C., Yokomori, T. (eds) DNA Computing. DNA 2006. Lecture Notes in Computer Science, vol 4287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11925903_2

Download citation

  • DOI: https://doi.org/10.1007/11925903_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49024-1

  • Online ISBN: 978-3-540-68423-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics