Algorithmic quipu representation of non-cooperative directed 2D tile assembly

DOI10.1016/J.TCS.2026.116116MaRDI QIDQ7319262zbMATH OpenFDO

Authors Jérôme O. Durand-Lose, Hendrik Jan Hoogeboom, Nataşa Jonoska

Publication date 25 August 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.116116

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• An introduction to tile-based self-assembly and a survey of recent results
• Complexity of Self‐Assembled Shapes
• Deterministic aperiodic tile sets
• Directed non-cooperative tile assembly is decidable
• scientific article; zbMATH DE number 1948487 (Why is no real title available?)
• Limitations of self-assembly at temperature 1
• The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation
• The program-size complexity of self-assembled paths
• The program-size complexity of self-assembled squares (extended abstract)
• The tile assembly model is intrinsically universal

This page was built for publication: Algorithmic quipu representation of non-cooperative directed 2D tile assembly

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