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

DOI10.1007/S11047-010-9193-1zbMath1226.05081OpenAlexW2001707131MaRDI QIDQ537828

Lila Kari, Eugen Czeizler

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

self-assemblyWang tilesneighborhoods

Mathematics Subject Classification ID

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

Related Items (1)

Polyominoes simulating arbitrary-neighborhood zippers and tilings

Cites Work

• Unnamed Item
• Reversibility and surjectivity problems of cellular automata
• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
• The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly

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