The Domino problem is undecidable on every rhombus subshift - Laboratoire Interdisciplinaire des Sciences du Numérique Access content directly
Conference Papers Year : 2023

The Domino problem is undecidable on every rhombus subshift

Abstract

We extend the classical Domino problem to any tiling of rhombus-shaped tiles. For any subshift X of edge-to-edge rhombus tilings, such as the Penrose subshift, we prove that the associated X-Domino problem is Π 0 1-hard and therefore undecidable. It is Π 0 1-complete when the subshift X is given by a computable sequence of forbidden patterns.
Fichier principal
Vignette du fichier
domino-rhombus_lipics.pdf (640.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04004801 , version 1 (25-02-2023)

Identifiers

Cite

Benjamin Hellouin de Menibus, Victor H Lutfalla, Camille Noûs. The Domino problem is undecidable on every rhombus subshift. Developments in Language Theory (DLT) 2023, Frank Drewes; Martin Berglund; Johanna Björklund; Lena Strobl, Jun 2023, Umeå, Sweden. ⟨hal-04004801⟩
60 View
15 Download

Altmetric

Share

Gmail Facebook X LinkedIn More