One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile
From MaRDI portal
Publication:5167756
DOI10.1007/978-3-662-43948-7_31zbMath1410.68123OpenAlexW1948499615MaRDI QIDQ5167756
Damien Woods, Andrew Winslow, Robert T. Schweller, Martin L. Demaine, Erik D. Demaine, Sándor P. Fekete, Matthew J. Patitz
Publication date: 1 July 2014
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1721.1/126249
Related Items (17)
A Brief Tour of Theoretical Tile Self-Assembly ⋮ Strict self-assembly of fractals using multiple hands ⋮ Universality in Molecular and Cellular Computing ⋮ Self-assembly of 4-sided fractals in the two-handed tile assembly model ⋮ Flipping Tiles: Concentration Independent Coin Flips in Tile Self-Assembly ⋮ The need for seed (in the abstract Tile Assembly Model) ⋮ Concentration independent random number generation in tile self-assembly ⋮ Binary pattern tile set synthesis is NP-hard ⋮ New geometric algorithms for fully connected staged self-assembly ⋮ Parallel Computation Using Active Self-assembly ⋮ Fast arithmetic in algorithmic self-assembly ⋮ Parallel computation using active self-assembly ⋮ Particle-based assembly using precise global control ⋮ Geometric tiles and powers and limitations of geometric hindrance in self-assembly ⋮ Reflections on tiles (in self-assembly) ⋮ An introduction to tile-based self-assembly and a survey of recent results ⋮ The two-handed tile assembly model is not intrinsically universal
This page was built for publication: One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile