A subshift of finite type is a set of tilings of a group subject to a finite number of local
constraints, where the group acts by translation. In recent years, much progress has been …

The classical Domino problem asks whether there exists a tiling in which none of the
forbidden patterns given as input appear. In this paper, we consider the aperiodic version of …

We study the seeded domino problem, the recurring domino problem and the $ k $-SAT
problem on finitely generated groups. These problems are generalization of their original …

In this paper we study the directions of periodicity of multidimensional subshifts of finite type
(SFTs) and of multidimensional effectively closed and sofic subshifts. A configuration of a …

Given a finite set of square tiles, the domino problem is the question of whether is it possible
ta tile the plane using these tiles. This problem is known to be undecidable in the planar …

1In Lemma 2.4, we denote NC1 for “Nick's Class” of complexity of level 1, ie the class of
languages L⊆ Σ∗ such that L is decidable by Boolean circuits with a polynomial number of …

Tilings consist in covering a surface–most of the time the Euclidean plane–by copies of
geometric tiles, placed next to each other without holes nor overlaps. They are at the origin …