Abstract
We introduce a model of self-assembly P systems as devices that use some of the features of population P systems to progressively grow a graph structure by forming new bonds between the existing cells and some new cells which are brought into the system step by step. The new cells are then able to self-assemble locally either at the level of cells or at the level of neighbourhoods of cells by using bond-making rules according to a specific self-assembly model. We describe two self-assembly models, called respectively parallel single-point self-assembly and parallel multi-point self-assembly. Then, we precisely state the problem of programmable self-assembly for P systems as the problem of uniquely generating a given graph by means of self-assembly P systems. In this respect, we show how to define a self-assembly P systems that uniquely generates a complete binary tree by using a “minimal” set of resources.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abelson, H., Allen, D., Coore, D., Hanson, C., Homsy, G., Knight, F.T., Nagpal, R., Rauch, E., Sussman, J.G., Weiss, R.: Amorphous Computing. Communication of the ACM 43, 74–82 (2000)
Bernardini, F., Gheorghe, M.: Population P Systems. Journal of Universal Computer Science 20, 509–539 (2002)
Giavitto, J.-L., Michel, O.: The Topological Structure of Membrane Computing. Fundamenta Informaticae 49, 107–129 (2002)
Klavins, E.: Automatic Synthesis of Controllers for Assembly and Formation Forming. In: Proceedings of the International Conference on Robotics and Automation (2002)
Krasnogor, N., Gustafson, S.: A Family of Conceptual Problems in the Automated Design of Systems Self-Assembly. In: Proceedings of the 2nd International Conference on the Foundations of Nanoscience: Self-Assembled Architectures and Devices (2005)
Păun, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 1-3. Springer, Heidelberg (1997)
Winfree, E.: Algorithmic Self-Assembly of DNA. PhD Thesis, California Institute of Technology (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bernardini, F., Gheorghe, M., Krasnogor, N., Giavitto, JL. (2005). On Self-assembly in Population P Systems. In: Calude, C.S., Dinneen, M.J., Păun, G., Pérez-Jímenez, M.J., Rozenberg, G. (eds) Unconventional Computation. UC 2005. Lecture Notes in Computer Science, vol 3699. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560319_6
Download citation
DOI: https://doi.org/10.1007/11560319_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29100-8
Online ISBN: 978-3-540-32022-7
eBook Packages: Computer ScienceComputer Science (R0)