Staged self-assembly and polyomino context-free grammars

DOI10.1007/s11047-014-9423-zzbMath1415.68102arXiv1304.7038OpenAlexW2103599323MaRDI QIDQ2003475

Andrew Winslow

Publication date: 8 July 2019

Published in: Lecture Notes in Computer Science, Natural Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.7038

zbMATH Keywords

combinatorial optimizationformal languagesbiocomputing2HAMaTAMhierarchical self-assemblytile-assembly

Mathematics Subject Classification ID

Related Items (8)

Verification in staged tile self-assembly ⋮ Non-cooperative Algorithms in Self-assembly ⋮ Simulation of multiple stages in single bin active tile self-assembly ⋮ Unnamed Item ⋮ Optimal staged self-assembly of general shapes ⋮ Producibility in hierarchical self-assembly ⋮ Size-separable tile self-assembly: a tight bound for temperature-1 mismatch-free systems ⋮ Optimal staged self-assembly of linear assemblies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• One-dimensional staged self-assembly
• Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
• One-Dimensional Staged Self-assembly
• Intrinsic Universality in Self-Assembly
• The program-size complexity of self-assembled squares (extended abstract)
• The Smallest Grammar Problem
• Approximation of Grammar-Based Compression via Recompression
• Running time and program size for self-assembled squares
• DNA Computing
• Parallelism and Time in Hierarchical Self-Assembly

This page was built for publication: Staged self-assembly and polyomino context-free grammars