Triangular tile self-assembly systems

DOI10.1007/978-3-642-18305-8_9MaRDI QIDQ3070964zbMATH OpenOpenAlexFDO

Authors Lila Kari, Shinnosuke Seki, Zhi Xu

Publication date 28 January 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-18305-8_9

Mathematics Subject Classification ID

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

Recommendations

• Triangular and hexagonal tile self-assembly systems
• One tile to rule them all: simulating any tile assembly system with a single universal tile
• Strict Self-assembly of Discrete Sierpinski Triangles
• Self-assembly with geometric tiles

Cites work

• Reducing tile complexity for self-assembly through temperature programming
• Running time and program size for self-assembled squares
• The program-size complexity of self-assembled squares (extended abstract)
• The undecidability of the domino problem
• Undecidability and nonperiodicity for tilings of the plane

Cited in

(6)

• Computing in continuous space with self-assembling polygonal tiles (extended abstract)
• Triangular and hexagonal tile self-assembly systems
• One tile to rule them all: simulating any tile assembly system with a single universal tile
• Triangular tile latching system
• Self-assembling micrites based on the Platonic solids
• Iterative self-assembly with dynamic strength transformation and temperature control

This page was built for publication: Triangular tile self-assembly systems

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