Non-cooperative Algorithms in Self-assembly

DOI10.1007/978-3-319-21819-9_20zbMath1465.68088arXiv1406.6889OpenAlexW2963510217MaRDI QIDQ2945574

Pierre-Étienne Meunier

Publication date: 14 September 2015

Published in: Unconventional Computation and Natural Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Other nonclassical models of computation (68Q09)

Cites Work

• Unnamed Item
• Families of prudent self-avoiding walks
• Staged self-assembly and polyomino context-free grammars
• The program-size complexity of self-assembled squares (extended abstract)

This page was built for publication: Non-cooperative Algorithms in Self-assembly