Polyomino tilings, cellular automata and codicity

DOI10.1016/0304-3975(94)00201-SzbMath0873.68139OpenAlexW2053863683MaRDI QIDQ672463

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)

Related Items (13)

Unbordered Pictures: Properties and Construction ⋮ Full sets of pictures to encode pictures ⋮ Defect theorem in the plane ⋮ Characterization and measure of infinite two-dimensional strong prefix codes ⋮ Structure and properties of strong prefix codes of pictures ⋮ The code problem for directed figures ⋮ Picture codes and deciphering delay ⋮ Two-dimensional comma-free and cylindric codes ⋮ Sets of Pictures Avoiding Overlaps ⋮ DIRECTED FIGURE CODES: DECIDABILITY FRONTIER ⋮ PREFIX PICTURE CODES: A DECIDABLE CLASS OF TWO-DIMENSIONAL CODES ⋮ Picture codes ⋮ Two-dimensional codes

Cites Work

• Unnamed Item
• Unnamed Item
• An undecidable problem about rational sets and contour words of polyominoes
• On translating one polyomino to tile the plane
• Domino-tiling games
• The undecidability of the domino problem

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