The domino problem is undecidable on every rhombus subshift

DOI10.1007/978-3-031-33264-7_9arXiv2302.12086OpenAlexW4377081604MaRDI QIDQ6067331

Camille Noûs, Benjamin Hellouin de Menibus, Victor H. Lutfalla

Publication date: 16 November 2023

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2302.12086

zbMATH Keywords

decidabilityrhombus tilingDomino problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deceptions in quasicrystal growth
• Tiling a polygon with parallelograms
• Theory of computation.
• The Domino Problem for Self-similar Structures
• About the Domino Problem for Subshifts on Groups
• The undecidability of the domino problem
• Domino Problem Under Horizontal Constraints

This page was built for publication: The domino problem is undecidable on every rhombus subshift