Towards a neighborhood simplification of tile systems: from Moore to quasi-linear dependencies

DOI10.1007/S11047-010-9193-1MaRDI QIDQ537828zbMATHOpenAlexFDO

Authors Eugen Czeizler, Lila Kari

Publication date 23 May 2011

Published in Natural Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11047-010-9193-1

zbMATH Keywords

Wang tilesself-assemblyneighborhoods

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Recommendations

• Polyominoes simulating arbitrary-neighborhood zippers and tilings
• Complexity of Self‐Assembled Shapes
• scientific article; zbMATH DE number 7298599
• The undecidability of the infinite ribbon problem: implications for computing by self-assembly
• An introduction to tile-based self-assembly

Cites work

• scientific article; zbMATH DE number 3968590 (Why is no real title available?)
• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
• Reversibility and surjectivity problems of cellular automata
• The undecidability of the infinite ribbon problem: implications for computing by self-assembly

Cited in

(1)

• Polyominoes simulating arbitrary-neighborhood zippers and tilings

This page was built for publication: Towards a neighborhood simplification of tile systems: from Moore to quasi-linear dependencies

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