Domino Problem Under Horizontal Constraints - Archive ouverte HAL Access content directly
Conference Papers Year :

Domino Problem Under Horizontal Constraints


The Domino Problem on Z² asks if it is possible to tile the plane with a given set of Wang tiles; it is a classical decision problem which is known to be undecidable. The purpose of this article is to parameterize this problem to explore the frontier between decidability and undecidability. To do so we fix some horizontal constraints H on the tiles and consider a new Domino Problem DPH : given a vertical constraint, is it possible to tile the plane? We characterize the nearest-neighbor horizontal constraints where DPH is decidable using graphs combinatorics.
Fichier principal
Vignette du fichier
LIPIcs-STACS-2020-26 (1).pdf (527.53 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-02380657 , version 1 (08-12-2020)



Nathalie Aubrun, Mathieu Sablik, Julien Esnay. Domino Problem Under Horizontal Constraints. STACS 2020 37th International Symposium on Theoretical Aspects of Computer Science, 2020, Montpellier, France. ⟨10.4230/LIPIcs.STACS.2020.26⟩. ⟨hal-02380657⟩
113 View
46 Download



Gmail Facebook Twitter LinkedIn More