4 citations · 8 across the 10 of their papers we have counts for
10 papers
On the cohomology of homshifts
Nishant Chandgotia, Silvère Gangloff, Benjamin Hellouin de Menibus +1
We study the cohomology of symbolic dynamical systems called homshifts: they are the nearest-neighbour shifts of finite type whose adjacency rules are the same in ev…
Undecidability of the block gluing classes of homshifts
Nishant Chandgotia, Silvère Gangloff, Benjamin Hellouin de Menibus +1
A homshift is a -dimensional shift of finite type which arises as the space of graph homomorphisms from the grid graph to a finite connected undirected graph .…
String attractors and bi-infinite words
Pierre Béaur, France Gheeraert, Benjamin Hellouin de Menibus
String attractors are a combinatorial tool coming from the field of data compression. It is a set of positions within a word which captures an occurrence of every factor. While one…
Two-player Domino games
Benjamin Hellouin de Menibus, Rémi Pallen
We introduce a 2-player game played on an infinite grid, initially empty, where each player in turn chooses a vertex and colours it. The first player aims to create some pattern fr…
Sturmian and infinitely desubstitutable words accepted by an ω-automaton
Pierre Béaur, Benjamin Hellouin de Menibus
Given an -automaton and a set of substitutions, we look at which accepted words can also be defined through these substitutions, and in particular if there is at least one. We i…
The Domino problem is undecidable on every rhombus subshift
Benjamin Hellouin de Menibus, Victor H. Lutfalla, Camille Noûs
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 as…
Short-range and long-range order: a transition in block-gluing behavior in Hom shifts
Silvere Gangloff, Benjamin Hellouin de Menibus, Piotr Oprocha
Hom shifts form a class of multidimensional shifts of finite type (SFT) and consist of colorings of the grid Z2 where adjacent colours must be neighbors in a fixed finite undirecte…
Asymptotic behaviour of the one-dimensional "rock-paper-scissors" cyclic cellular automaton
Benjamin Hellouin de Menibus, Yvan Le Borgne
The one-dimensional three-state cyclic cellular automaton is a simple spatial model with three states in a cyclic "rock-paper-scissors" prey-predator relationship. Starting from a…
Characterizing Asymptotic Randomization in Abelian Cellular Automata
Benjamin Hellouin de Menibus, Ville Salo, Guillaume Theyssier
Abelian cellular automata (CA) are CA which are group endomorphisms of the full group shift when endowing the alphabet with an abelian group structure. A CA randomizes an initial p…
Characterisation of sets of limit measures after iteration of a cellular automaton on an initial measure
Benjamin Hellouin de Menibus, Mathieu Sablik
The asymptotic behavior of a cellular automaton iterated on a random configuration is well described by its limit probability measure(s). In this paper, we characterize measures an…