Polyomino tilings, cellular automata and codicity

DOI10.1016/0304-3975(94)00201-SMaRDI QIDQ672463zbMATH OpenOpenAlexFDO

Authors Philippe Aigrain, Danièle Beauquier

Publication date 28 February 1997

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

Full work available at URL https://doi.org/10.1016/0304-3975(94)00201-s

zbMATH Keywords

polyomino

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• Cellular automata, tilings and (un)computability
• scientific article; zbMATH DE number 2040939
• Polyomino convolutions and tiling problems
• Cellular automata for the self-stabilisation of colourings and tilings
• ON A CHARACTERIZATION OF CELLULAR AUTOMATA IN TILINGS OF THE HYPERBOLIC PLANE
• Tiling problems, automata, and tiling graphs
• Tiling with polyominoes and combinatorial group theory
• Cellular automata on irregular tessellations
• scientific article; zbMATH DE number 7357524
• Polyominoes simulating arbitrary-neighborhood zippers and tilings

Cites work

• scientific article; zbMATH DE number 1988973 (Why is no real title available?)
• scientific article; zbMATH DE number 3451488 (Why is no real title available?)
• An undecidable problem about rational sets and contour words of polyominoes
• Domino-tiling games
• On translating one polyomino to tile the plane
• The undecidability of the domino problem

Cited in

(19)

• Characterization and measure of infinite two-dimensional strong prefix codes
• Unbordered pictures: properties and construction
• Prefix picture codes: a decidable class of two-dimensional codes
• Sets of pictures avoiding overlaps
• Two-dimensional codes
• scientific article; zbMATH DE number 7357524 (Why is no real title available?)
• Full sets of pictures to encode pictures
• Directed figure codes: decidability frontier
• Defect theorem in the plane
• Picture codes
• Self-stabilisation of Cellular Automata on Tilings
• Computing and Combinatorics
• Picture codes and deciphering delay
• The code problem for directed figures
• Generalized Gandy-Păun-Rozenberg Machines for Tile Systems and Cellular Automata
• Two-dimensional comma-free and cylindric codes
• Polyominoes simulating arbitrary-neighborhood zippers and tilings
• Code for polyomino and computer search of isospectral polyominoes
• Structure and properties of strong prefix codes of pictures

This page was built for publication: Polyomino tilings, cellular automata and codicity

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