On Self-assembly in Population P Systems
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.
KeywordsGraph Structure Transformation Rule Seed Cell Transitive Closure Derivation Step
Unable to display preview. Download preview PDF.
- 2.Bernardini, F., Gheorghe, M.: Population P Systems. Journal of Universal Computer Science 20, 509–539 (2002)Google Scholar
- 4.Klavins, E.: Automatic Synthesis of Controllers for Assembly and Formation Forming. In: Proceedings of the International Conference on Robotics and Automation (2002)Google Scholar
- 5.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)Google Scholar
- 8.Winfree, E.: Algorithmic Self-Assembly of DNA. PhD Thesis, California Institute of Technology (1998)Google Scholar