Strict self-assembly of discrete Sierpinski triangles
From MaRDI portal
Publication:1004083
DOI10.1016/J.TCS.2008.09.062zbMATH Open1160.68012OpenAlexW2097477735MaRDI QIDQ1004083FDOQ1004083
Authors: 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
Recommendations
Fractals (28A80) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Combinatorial complexity of geometric structures (52C45)
Cites Work
- The program-size complexity of self-assembled squares (extended abstract)
- Combinatorial optimization problems in self-assembly
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity of Self‐Assembled Shapes
- Title not available (Why is that?)
- Title not available (Why is that?)
- The undecidability of the infinite ribbon problem: implications for computing by self-assembly
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mathematical Foundations of Computer Science 2005
Cited In (38)
- Geometric tiles and powers and limitations of geometric hindrance in self-assembly
- An introduction to tile-based self-assembly and a survey of recent results
- Scaled pier fractals do not strictly self-assemble
- Strict Self-assembly of Discrete Sierpinski Triangles
- The two-handed tile assembly model is not intrinsically universal
- ACTIVE TILE SELF-ASSEMBLY, PART 2: SELF-SIMILAR STRUCTURES AND STRUCTURAL RECURSION
- Computability and complexity in self-assembly
- Self-assembly of decidable sets
- Limitations of self-assembly at temperature 1
- Approximate self-assembly of the Sierpinski triangle
- Asynchronous signal passing for tile self-assembly: fuel efficient computation and efficient assembly of shapes
- Scaled Tree Fractals Do not Strictly Self-assemble
- Producibility in hierarchical self-assembly
- Self-assembly of discrete self-similar fractals
- Hierarchical growth is necessary and (sometimes) sufficient to self-assemble discrete self-similar fractals
- On the effects of hierarchical self-assembly for reducing program-size complexity
- Exact shapes and Turing universality at temperature 1 with a single negative glue
- ALCH: an imperative language for chemical reaction network-controlled tile assembly
- The need for seed (in the abstract Tile Assembly Model)
- Fractal dimension of assemblies in the abstract tile assembly model
- Self-assembly of infinite structures: a survey
- Hierarchical Self-Assembly of Fractals with Signal-Passing Tiles
- Reducing tile complexity for the self-assembly of scaled shapes through temperature programming
- On the complexity of asynchronous freezing cellular automata
- The power of duples (in self-assembly): it's not so hip to be square
- Self-assembly of 4-sided fractals in the two-handed tile assembly model
- Strict self-assembly of fractals using multiple hands
- Self-assembling rulers for approximating generalized Sierpinski carpets
- Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly
- Impossibility of strict assembly of infinite fractals by oritatami
- Program size and temperature in self-assembly
- Self-assembly of the discrete Sierpinski carpet and related fractals
- Programmable single-stranded architectures for computing
- Reflections on tiles (in self-assembly)
- 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
- Edge domination number and the number of minimum edge dominating sets in pseudofractal scale-free web and Sierpiński gasket
- Parallelism and time in hierarchical self-assembly
This page was built for publication: Strict self-assembly of discrete Sierpinski triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1004083)
