Polyominoes simulating arbitrary-neighborhood zippers and tilings

DOI10.1016/j.tcs.2011.05.012zbMath1246.68242OpenAlexW2130729091MaRDI QIDQ652151

Benoît Masson, Lila Kari

Publication date: 19 December 2011

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

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

zbMATH Keywords

tilingsDNA computingpolyominoesself-assembly

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of tessellation and tiling problems (05B45) Polyominoes (05B50)

Cites Work

• Unnamed Item
• Towards a neighborhood simplification of tile systems: from Moore to quasi-linear dependencies
• Reconstructing convex polyominoes from horizontal and vertical projections
• On the dynamics and recursive properties of multidimensional symbolic systems
• On translating one polyomino to tile the plane
• Expansiveness, entropy and polynomial growth for groups acting on subshifts by automorphisms
• Reconstructing \(hv\)-convex polyominoes from orthogonal projections
• Theory of cellular automata: a survey
• Automorphisms of \(\mathbb Z^ d\)-subshifts of finite type
• Undecidability and nonperiodicity for tilings of the plane
• The program-size complexity of self-assembled squares (extended abstract)
• Reducing tile complexity for self-assembly through temperature programming
• The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly
• An Introduction to Symbolic Dynamics and Coding
• Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues
• The undecidability of the domino problem

This page was built for publication: Polyominoes simulating arbitrary-neighborhood zippers and tilings