Polyomino tilings, cellular automata and codicity
type: Item
instance of: scholarly article
title: Polyomino tilings, cellular automata and codicity
zbMATH Open document ID: 0873.68139
DOI: 10.1016/0304-3975(94)00201-S
author: Philippe Aigrain
author: Danièle Beauquier
published in: Theoretical Computer Science
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68Q80
zbMATH DE Number: 985009
zbMATH Keywords: polyomino
MaRDI profile type: MaRDI publication profile
cites work: An undecidable problem about rational sets and contour words of polyominoes
cites work: On translating one polyomino to tile the plane
cites work: The undecidability of the domino problem
cites work: Q4430300
cites work: Domino-tiling games
cites work: Q4775507
full work available at URL: 0304-3975(94)00201-s
OpenAlex ID: W2053863683
Recommended article: Cellular automata, tilings and (un)computability
Recommended article: Q4452088
Recommended article: Polyomino convolutions and tiling problems
Recommended article: Cellular automata for the self-stabilisation of colourings and tilings
Recommended article: ON A CHARACTERIZATION OF CELLULAR AUTOMATA IN TILINGS OF THE HYPERBOLIC PLANE
Recommended article: Tiling problems, automata, and tiling graphs
Recommended article: Tiling with polyominoes and combinatorial group theory
Recommended article: Cellular automata on irregular tessellations
Recommended article: Q4992879
Recommended article: Polyominoes simulating arbitrary-neighborhood zippers and tilings
description: scientific article; zbMATH DE number 985009