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

DOI10.1007/S11047-010-9193-1zbMATH Open1226.05081OpenAlexW2001707131MaRDI QIDQ537828FDOQ537828

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

Wang tilesself-assemblyneighborhoods

Mathematics Subject Classification ID

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

Cites Work

• Reversibility and surjectivity problems of cellular automata
• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
• Title not available (Why is that?)
• The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly

Cited In (1)

• Polyominoes simulating arbitrary-neighborhood zippers and tilings

   Recommendations

• Polyominoes simulating arbitrary-neighborhood zippers and tilings 👍 👎
• Complexity of Self‐Assembled Shapes 👍 👎
• Title not available (Why is that?) 👍 👎
• The undecidability of the infinite ribbon problem: implications for computing by self-assembly 👍 👎
• An Introduction to Tile-Based Self-assembly 👍 👎

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)