On aggregation in multiset-based self-assembly of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5016703 (Why is no real title available?)
- scientific article; zbMATH DE number 5671765 (Why is no real title available?)
- scientific article; zbMATH DE number 1236223 (Why is no real title available?)
- A Grammatical Approach to Self-Organizing Robotic Systems
- A guide to membrane computing.
- Complexity of Self‐Assembled Shapes
- Computing with membranes
- Languages generated by P systems with active membranes
- Multiset-based self-assembly of graphs
- Running time and program size for self-assembled squares
- Self-assembling DNA graphs
- The program-size complexity of self-assembled squares (extended abstract)
Cited in
(8)- Robust Self-assembly of Graphs
- Adaptive aggregation on graphs
- Self-assembling graphs
- Morphogenetic systems for resource bounded computation and modeling
- From P systems to morphogenetic systems: an overview and open problems
- Multiset-based self-assembly of graphs
- 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)