Nanosystems: molecular machinery, manufacturing, and computation
Nanosystems: molecular machinery, manufacturing, and computation
Communications of the ACM
The program-size complexity of self-assembled squares (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
Handbook of Formal Languages
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Algorithmic self-assembly of dna
Algorithmic self-assembly of dna
Nanotechnology: Science and Computation (Natural Computing Series)
Nanotechnology: Science and Computation (Natural Computing Series)
Structural DNA nanotechnology: molecular construction and computation
UC'05 Proceedings of the 4th international conference on Unconventional Computation
On self-assembly in population p systems
UC'05 Proceedings of the 4th international conference on Unconventional Computation
A computational model for self-assembling flexible tiles
UC'05 Proceedings of the 4th international conference on Unconventional Computation
| Hi-index | 0.00 |
We present a model for self-assembly of graphs based on multisets and the formalism of membrane systems. The model deals with aggregates of cells which are defined as undirected graphs where a multiset over a fixed alphabet is assigned to each vertex. The evolution of these aggregates is determined by an application of multiset-based aggregation rules to enlarge the current structure as well as an application of membrane-systems-based communication rules to enable cells to exchange objects alongside the edges of the graph. We compare the generative power of selfassembly membrane systems with and without communication rules, and we characterise properties of the sets of graphs generated by these systems. We also introduce two notions of stability for self-assembly processes that capture the idea of having produced a stable structure. Finally, we investigate self-assembly membrane systems where the alphabet is a singleton.