Strict self-assembly of discrete Sierpinski triangles

DOI10.1016/j.tcs.2008.09.062zbMath1160.68012OpenAlexW2097477735MaRDI QIDQ1004083

James I. Lathrop, Jack H. Lutz, Scott M. Summers

Publication date: 2 March 2009

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

Full work available at URL: https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=15811&context=rtd

zbMATH Keywords

fractalsmolecular computingself-assemblySierpinski triangles

Mathematics Subject Classification ID

Fractals (28A80) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Combinatorial complexity of geometric structures (52C45)

Related Items (35)

Fractal dimension of assemblies in the abstract tile assembly model ⋮ Strict self-assembly of fractals using multiple hands ⋮ The power of duples (in self-assembly): it's not so hip to be square ⋮ ASYNCHRONOUS SIGNAL PASSING FOR TILE SELF-ASSEMBLY: FUEL EFFICIENT COMPUTATION AND EFFICIENT ASSEMBLY OF SHAPES ⋮ Self-assembly of 4-sided fractals in the two-handed tile assembly model ⋮ Self-assembling rulers for approximating generalized Sierpinski carpets ⋮ Scaled Tree Fractals Do not Strictly Self-assemble ⋮ Limitations of self-assembly at temperature 1 ⋮ Self-assembly of infinite structures: a survey ⋮ Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D ⋮ Hierarchical self-assembly of fractals with signal-passing tiles ⋮ Impossibility of strict assembly of infinite fractals by oritatami ⋮ Reducing tile complexity for the self-assembly of scaled shapes through temperature programming ⋮ The need for seed (in the abstract Tile Assembly Model) ⋮ Unnamed Item ⋮ Program size and temperature in self-assembly ⋮ On the effects of hierarchical self-assembly for reducing program-size complexity ⋮ Approximate self-assembly of the Sierpinski triangle ⋮ Producibility in hierarchical self-assembly ⋮ Hierarchical growth is necessary and (sometimes) sufficient to self-assemble discrete self-similar fractals ⋮ Computability and complexity in self-assembly ⋮ Parallelism and Time in Hierarchical Self-Assembly ⋮ Self-assembly of discrete self-similar fractals ⋮ Self-assembly of decidable sets ⋮ Geometric tiles and powers and limitations of geometric hindrance in self-assembly ⋮ Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly ⋮ On the complexity of asynchronous freezing cellular automata ⋮ Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue ⋮ Reflections on tiles (in self-assembly) ⋮ Scaled pier fractals do not strictly self-assemble ⋮ Hierarchical Self-Assembly of Fractals with Signal-Passing Tiles ⋮ ACTIVE TILE SELF-ASSEMBLY, PART 2: SELF-SIMILAR STRUCTURES AND STRUCTURAL RECURSION ⋮ EDGE DOMINATION NUMBER AND THE NUMBER OF MINIMUM EDGE DOMINATING SETS IN PSEUDOFRACTAL SCALE-FREE WEB AND SIERPIŃSKI GASKET ⋮ An introduction to tile-based self-assembly and a survey of recent results ⋮ The two-handed tile assembly model is not intrinsically universal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The program-size complexity of self-assembled squares (extended abstract)
• Combinatorial optimization problems in self-assembly
• The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly
• Complexity of Self‐Assembled Shapes
• Mathematical Foundations of Computer Science 2005

This page was built for publication: Strict self-assembly of discrete Sierpinski triangles