scientific article; zbMATH DE number 3222108
From MaRDI portal
Publication:5509685
Cited in
(31)- Strict self-assembly of discrete Sierpinski triangles
- Convergence rates of Markov chains for some self-assembly and non-saturated Ising models
- Dominoes and the complexity of subclasses of logical theories
- Solvable classes of pseudoprenex formulas
- Space tilings and local isomorphism
- On causal ^2-systems
- Path constraints in semistructured databases
- Thue trees
- Tilings: recursivity and regularity
- Space tilings and substitutions
- The fluted fragment with transitive relations
- An introduction to tile-based self-assembly and a survey of recent results
- A logical approach to locality in pictures languages
- A Topological Study of Tilings
- Computability and Complexity in Self-assembly
- Self-assembly of Decidable Sets
- Self-correcting Self-assembly: Growth Models and the Hammersley Process
- Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
- Turing degrees of multidimensional SFTs
- Program size and temperature in self-assembly
- Aperiodic tilings and entropy
- The undecidability of the domino problem
- Parallelism and time in hierarchical self-assembly
- Parallelism and time in hierarchical self-assembly
- Limitations of self-assembly at temperature 1
- Self-assembly of infinite structures: a survey
- Relevant S is undecidable
- The complexity of theorem-proving procedures
- Error suppression mechanisms for DNA tile self-assembly and their simulation
- Rectangular tileability and complementary tileability are undecidable
- Undecidability of PDL with \(L=\{a^{2^ i}| i\geq 0\}\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5509685)
