Skip to Main content Skip to Navigation
Conference papers

Domino Problem Under Horizontal Constraints

Abstract : 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.
Complete list of metadata
Contributor : Nathalie Aubrun Connect in order to contact the contributor
Submitted on : Tuesday, December 8, 2020 - 10:32:27 PM
Last modification on : Wednesday, November 3, 2021 - 8:49:23 AM
Long-term archiving on: : Tuesday, March 9, 2021 - 8:18:11 PM


LIPIcs-STACS-2020-26 (1).pdf
Publisher files allowed on an open archive



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⟩



Record views


Files downloads