On aggregation in multiset-based self-assembly of graphs

DOI10.1007/s11047-010-9183-3zbMath1213.68257OpenAlexW2013693648MaRDI QIDQ537813

Francesco Bernardini, Giuditta Franco, Matteo Cavaliere, Hendrik Jan Hoogeboom, Robert Brijder, Grzegorz Rozenberg

Publication date: 23 May 2011

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-010-9183-3

zbMATH Keywords

self-assemblycell aggregationmultiset guided graph transformations

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items

From P systems to morphogenetic systems: an overview and open problems ⋮ Morphogenetic systems for resource bounded computation and modeling

Cites Work

• Self-assembling DNA graphs
• Computing with membranes
• Languages generated by P systems with active membranes
• A guide to membrane computing.
• The program-size complexity of self-assembled squares (extended abstract)
• Running time and program size for self-assembled squares
• A Grammatical Approach to Self-Organizing Robotic Systems
• Complexity of Self‐Assembled Shapes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item