Self-assembly of infinite structures: a survey

DOI10.1016/J.TCS.2010.08.015MaRDI QIDQ616502zbMATH OpenOpenAlexFDO

Authors Matthew J. Patitz, Scott M. Summers

Publication date 10 January 2011

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

Full work available at URL https://doi.org/10.1016/j.tcs.2010.08.015

zbMATH Keywords

complexitytile assembly modelundecidabilitycomputabilityTuring machinestile self-assemblydiscrete self-similar fractalstile assembly systemtile assemby model (TAM)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of tessellation and tiling problems (05B45)

Recommendations

• scientific article; zbMATH DE number 7298599
• An introduction to tile-based self-assembly and a survey of recent results
• Intrinsic universality and the computational power of self-assembly
• The undecidability of the infinite ribbon problem: implications for computing by self-assembly
• Self-assembly of Discrete Self-similar Fractals

Cites work

• scientific article; zbMATH DE number 2086605 (Why is no real title available?)
• scientific article; zbMATH DE number 3222108 (Why is no real title available?)
• Activatable Tiles: Compact, Robust Programmable Assembly and Other Applications
• Combinatorial optimization problems in self-assembly
• Complexities for Generalized Models of Self-Assembly
• Complexities for generalized models of self-assembly
• Complexity of Compact Proofreading for Self-assembled Patterns
• Complexity of Self‐Assembled Shapes
• Computability and Complexity in Self-assembly
• DNA Computing
• DNA Computing
• Design and Simulation of Self-repairing DNA Lattices
• Limitations of Self-assembly at Temperature One
• Limitations of self-assembly at temperature 1
• Mathematical Foundations of Computer Science 2005
• Randomized Self-Assembly for Exact Shapes
• Randomized Self-assembly for Approximate Shapes
• Reducing tile complexity for self-assembly through temperature programming
• Running time and program size for self-assembled squares
• Self-assembly of Decidable Sets
• Self-assembly of discrete self-similar fractals
• Self-assembly of the discrete Sierpinski carpet and related fractals
• Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
• Strict self-assembly of discrete Sierpinski triangles
• The power of nondeterminism in self-assembly
• The program-size complexity of self-assembled squares (extended abstract)

Cited in

(14)

• An introduction to tile-based self-assembly and a survey of recent results
• Self-assembly of 3-D structures using 2-D folding tiles
• The undecidability of the infinite ribbon problem: implications for computing by self-assembly
• scientific article; zbMATH DE number 7298599 (Why is no real title available?)
• Fractal dimension of assemblies in the abstract tile assembly model
• Plane-filling properties of directed figures
• Transformations and Preservation of Self-assembly Dynamics through Homotheties
• Ideas about self assembly
• Hypergraph automata: a theoretical model for patterned self-assembly
• Hypergraph automata: a theoretical model for patterned self-assembly
• A Limit to the Power of Multiple Nucleation in Self-assembly
• A combinatorial approach to the problem of self-assembly
• A brief tour of theoretical tile self-assembly
• TCS special issue on computational self-assembly

This page was built for publication: Self-assembly of infinite structures: a survey

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