Substitutions and strongly deterministic tilesets

DOI10.1007/978-3-642-30870-3_47MaRDI QIDQ2904442zbMATH OpenOpenAlexFDO

Authors Bastien Le Gloannec, Nicolas Ollinger

Publication date 14 August 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-30870-3_47

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Cellular automata (computational aspects) (68Q80)

Recommendations

• Matching rules and substitution tilings
• Lots of aperiodic sets of tiles
• Tilings, substitution systems and dynamical systems generated by them
• Two-by-Two Substitution Systems and the Undecidability of the Domino Problem
• Weak colored local rules for planar tilings

Cited in

(5)

• Overlap coincidence to strong coincidence in substitution tiling dynamics
• Hierarchy and expansiveness in 2D subshifts of finite type
• Knight tiles: particles and collisions in the realm of 4-way deterministic tilings
• An aperiodic set of 11 Wang tiles
• Deterministic coloring of a family of complexes

This page was built for publication: Substitutions and strongly deterministic tilesets

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