On aggregation in multiset-based self-assembly of graphs

DOI10.1007/S11047-010-9183-3zbMATH Open1213.68257OpenAlexW2013693648MaRDI QIDQ537813FDOQ537813

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

Recommendations

• Multiset-based self-assembly of graphs
• Complexity of graph self-assembly in accretive systems and self-destructible systems
• Unconventional Computation
• Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems
• On the Complexity of Graph Self-assembly in Accretive Systems

zbMATH Keywords

cell aggregationself-assemblymultiset guided graph transformations

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• From P systems to morphogenetic systems: an overview and open problems
• Robust self-assembly of graphs
• Adaptive aggregation on graphs
• Morphogenetic systems for resource bounded computation and modeling
• Robust Self-assembly of Graphs
• Unconventional Computation

This page was built for publication: On aggregation in multiset-based self-assembly of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537813)