Self-organization in Cellular Automata: A Particle-Based Approach. - Benjamin Hellouin de Menibus; Mathieu Sablik (Developments in Language Theory, 2011)

Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width. - Benjamin Hellouin de Menibus; Takeaki Uno (TAMC, 2011)

Entry times in automata with simple defect dynamics - Benjamin Hellouin de Menibus; Mathieu Sablik (AUTOMATA & JAC, 2012)

Construction of mu-Limit Sets of Two-dimensional Cellular Automata. - Martin Delacourt; Benjamin Hellouin de Menibus (STACS, 2015)

Computing the entropy of one-dimensional decidable subshifts. - Silvère Gangloff; Benjamin Hellouin de Menibus (CoRR, 2016)

Self-organisation in cellular automata with coalescent particles: Qualitative and quantitative approaches. - Benjamin Hellouin de Menibus; Mathieu Sablik (CoRR, 2016)

Characterizing Asymptotic Randomization in Abelian Cellular Automata. - Benjamin Hellouin de Menibus; Ville Salo; Guillaume Theyssier (CoRR, 2017)

Characterisation of Limit Measures of Higher-Dimensional Cellular Automata. - Martin Delacourt; Benjamin Hellouin de Menibus (Theory Comput. Syst., 2017)

Aperiodic Points in Z2-subshifts. - Anaël Grandjean; Benjamin Hellouin de Menibus; Pascal Vanier (ICALP, 2018)

Nontrivial Turmites are Turing-universal. - Diego Maldonado; Anahí Gajardo; Benjamin Hellouin de Menibus; Andrés Moreira (J. Cell. Autom., 2018)

The Aperiodic Domino Problem in Higher Dimension. - Antonin Callard; Benjamin Hellouin de Menibus (STACS, 2022)

Sturmian and Infinitely Desubstitutable Words Accepted by an ømega-Automaton. - Pierre Béaur; Benjamin Hellouin de Menibus (WORDS, 2023)

The Domino Problem Is Undecidable on Every Rhombus Subshift. - Benjamin Hellouin de Menibus; Victor H. Lutfalla; Camille Noûs (DLT, 2023)

Sturmian and infinitely desubstitutable words accepted by an ω-automaton. - Pierre Béaur; Benjamin Hellouin de Menibus (CoRR, 2023)

Two-Player Domino Games. - Benjamin Hellouin de Menibus; Rémi Pallen (CiE, 2024)

String attractors and bi-infinite words. - Pierre Béaur; France Gheeraert; Benjamin Hellouin de Menibus (CoRR, 2024)

Alternating hierarchy of sushifts defined by nondeterministic plane-walking automata. - Benjamin Hellouin de Menibus; Pacôme Perrotin (CoRR, 2024)

Decision problems on geometric tilings. - Benjamin Hellouin de Menibus; Victor H. Lutfalla; Pascal Vanier (CoRR, 2024)

Minimality and Computability of Languages of G-Shifts. - Djamel Eddine Amir; Benjamin Hellouin de Menibus (ICALP, 2025)

Subshifts Defined by Nondeterministic and Alternating Plane-Walking Automata. - Benjamin Hellouin de Menibus; Pacôme Perrotin (STACS, 2025)

Undecidability of the block gluing classes of homshifts. - Nishant Chandgotia; Silvère Gangloff; Benjamin Hellouin de Menibus; Piotr Oprocha (CoRR, 2025)