On the tiling by translation problem
type: Item
instance of: scholarly article
title: On the tiling by translation problem
zbMATH Open document ID: 1156.05014
published in: Discrete Applied Mathematics
publication date: 2009-03-04T00:00:00Z
Mathematics Subject Classification ID: 05B50
Mathematics Subject Classification ID: 05B45
zbMATH DE Number: 5523181
zbMATH Keywords: tiling polyominoes
zbMATH Keywords: plane tesselation
zbMATH Keywords: longest common extensions
author: Srečko Brlek
author: Xavier Provençal
author: Jean-Marc Fédou
MaRDI profile type: Publication
full work available at URL: j.dam.2008.05.026
OpenAlex ID: W2134122221
cites work: The undecidability of the domino problem
cites work: Q5650383
cites work: Checker Boards and Polyominoes
cites work: Salient and Reentrant Points of Discrete Sets
cites work: Q4313096
cites work: Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino
cites work: Euclidean Paths: A New Representation of Boundary of Discrete Regions
cites work: On translating one polyomino to tile the plane
cites work: An algorithm for deciding if a polyomino tiles the plane
cites work: Q4681771
cites work: Linear time algorithms for finding and representing all the tandem repeats in a string
cites work: Algorithms on Strings, Trees and Sequences
cites work: Developments in Language Theory
cites work: PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS
cites work: Q4341774
DOI: 10.1016/J.DAM.2008.05.026
description: scientific article; zbMATH DE number 5523181