2 citations · 3 across the 9 of their papers we have counts for
10 papers
Parametrized complexity of relations between multidimensional subshifts
Nicanor Carrasco-Vargas, Benjamin Hellouin de Menibus, Rémi Pallen
We study the parametrized complexity of fundamental relations between multidimensional subshifts, such as equality, conjugacy, inclusion, and embedding, for subshifts of finite typ…
Minimality and computability of languages of G-shifts
Djamel Eddine Amir, Benjamin Hellouin de Menibus
Motivated by the notion of strong computable type for sets in computable analysis, we define the notion of strong computable type for -shifts, where is a finitely generated…
Symbol Frequencies in Surjective Cellular Automata
Benjamin Hellouin de Menibus, Ilkka Törmä, Ville Salo
We study the behavior of probability measures under iteration of a surjective cellular automaton. We solve the following question in the negative: if the initial measure is ergodic…
Decision problems on geometric tilings
Benjamin Hellouin de Menibus, Victor Lutfalla, Pascal Vanier
We study decision problems on geometric tilings. First, we study a variant of the Domino problem where square tiles are replaced by geometric tiles of arbitrary shape. We show that…
Subshifts defined by nondeterministic and alternating plane-walking automata
Benjamin Hellouin de Menibus, Pacôme Perrotin
Plane-walking automata were introduced by Salo & Törma to recognise languages of two-dimensional infinite words (subshifts), the counterpart of -way finite automata for two-dime…
Necessary conditions for tiling finitely generated amenable groups
Benjamin Hellouin de Menibus, Hugo Maturana Cornejo
We consider a set of necessary conditions which are efficient heuristics for deciding when a set of Wang tiles cannot tile a group. Piantadosi gave a necessary and sufficient condi…