Self-assembly of decidable sets
From MaRDI portal
Publication:553922
DOI10.1007/S11047-010-9218-9zbMATH Open1217.68097OpenAlexW1972005206MaRDI QIDQ553922FDOQ553922
Authors: Matthew J. Patitz, Scott M. Summers 
Publication date: 28 July 2011
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-010-9218-9
Recommendations
- Self-assembly of Decidable Sets
- Self-assembling finite automata
- scientific article; zbMATH DE number 2089986
- Computability and complexity in self-assembly
- Computability and Complexity in Self-assembly
- Self-assembling pushdown automata
- Decidability results for sets with atoms
- Complexity of Compact Proofreading for Self-assembled Patterns
- Automatic decidability and combinability
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Combinatorial aspects of tessellation and tiling problems (05B45)
Cites Work
- Strict self-assembly of discrete Sierpinski triangles
- The program-size complexity of self-assembled squares (extended abstract)
- Randomized Self-assembly for Approximate Shapes
- A domain-specific language for programming in the tile assembly model
- Title not available (Why is that?)
- Running time and program size for self-assembled squares
- Complexities for Generalized Models of Self-Assembly
- Temperature 1 self-assembly: deterministic assembly in 3D and probabilistic assembly in 2D
- Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
- Complexity of Self‐Assembled Shapes
- Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
- Reducing tile complexity for self-assembly through temperature programming
- The undecidability of the infinite ribbon problem: implications for computing by self-assembly
- Randomized Self-Assembly for Exact Shapes
Cited In (13)
- An introduction to tile-based self-assembly and a survey of recent results
- Computability and complexity in self-assembly
- Directed non-cooperative tile assembly is decidable
- Asynchronous signal passing for tile self-assembly: fuel efficient computation and efficient assembly of shapes
- The undecidability of the infinite ribbon problem: implications for computing by self-assembly
- Title not available (Why is that?)
- Fractal dimension of assemblies in the abstract tile assembly model
- The power of duples (in self-assembly): it's not so hip to be square
- Small tile sets that compute while solving mazes
- Strict self-assembly of fractals using multiple hands
- Computability and Complexity in Self-assembly
- Self-assembly of Decidable Sets
- Replication of Arbitrary Hole-Free Shapes via Self-assembly with Signal-Passing Tiles
This page was built for publication: Self-assembly of decidable sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q553922)
