On aggregation in multiset-based self-assembly of graphs
From MaRDI portal
Publication:537813
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
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?)
- Multiset-based self-assembly of graphs
Cited In (8)
- From P systems to morphogenetic systems: an overview and open problems
- Robust self-assembly of graphs
- Adaptive aggregation on graphs
- Multiset-based self-assembly of graphs
- Morphogenetic systems for resource bounded computation and modeling
- Robust Self-assembly of Graphs
- Unconventional Computation
- Self-assembling graphs
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)
