Benjamin Hellouin de Menibus

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 20

Top Topics

Cellular Automata

Top Venues

J. Cell. Autom.

Theory Comput. Syst.

Publications

Benjamin Hellouin de Menibus, Rémi Pallen
Two-Player Domino Games. CiE (2024)
Pierre Béaur, France Gheeraert, Benjamin Hellouin de Menibus
String attractors and bi-infinite words. CoRR (2024)
Pierre Béaur, Benjamin Hellouin de Menibus
Sturmian and Infinitely Desubstitutable Words Accepted by an ømega-Automaton. WORDS (2023)
Benjamin Hellouin de Menibus, Victor H. Lutfalla, Camille Noûs
The Domino Problem Is Undecidable on Every Rhombus Subshift. DLT (2023)
Benjamin Hellouin de Menibus, Rémi Pallen
Two-player Domino games. CoRR (2023)
Benjamin Hellouin de Menibus, Victor H. Lutfalla, Camille Noûs
The Domino problem is undecidable on every rhombus subshift. CoRR (2023)
Pierre Béaur, Benjamin Hellouin de Menibus
Sturmian and infinitely desubstitutable words accepted by an ω-automaton. CoRR (2023)
Antonin Callard, Benjamin Hellouin de Menibus
The aperiodic Domino problem in higher dimension. CoRR (2022)
Antonin Callard, Benjamin Hellouin de Menibus
The Aperiodic Domino Problem in Higher Dimension. STACS (2022)
Anaël Grandjean, Benjamin Hellouin de Menibus, Pascal Vanier
-subshifts. CoRR (2018)
Diego Maldonado, Anahí Gajardo, Benjamin Hellouin de Menibus, Andrés Moreira
Nontrivial Turmites are Turing-universal. J. Cell. Autom. 13 (5-6) (2018)
Anaël Grandjean, Benjamin Hellouin de Menibus, Pascal Vanier
-subshifts. ICALP (2018)
Benjamin Hellouin de Menibus, Takeaki Uno
Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width. CoRR (2018)
Diego Maldonado, Anahí Gajardo, Benjamin Hellouin de Menibus, Andrés Moreira
Nontrivial Turmites are Turing-universal. CoRR (2017)
Martin Delacourt, Benjamin Hellouin de Menibus
Characterisation of Limit Measures of Higher-Dimensional Cellular Automata. Theory Comput. Syst. 61 (4) (2017)
Benjamin Hellouin de Menibus, Ville Salo, Guillaume Theyssier
Characterizing Asymptotic Randomization in Abelian Cellular Automata. CoRR (2017)
Silvère Gangloff, Benjamin Hellouin de Menibus
Computing the entropy of one-dimensional decidable subshifts. CoRR (2016)
Benjamin Hellouin de Menibus, Mathieu Sablik
Self-organisation in cellular automata with coalescent particles: Qualitative and quantitative approaches. CoRR (2016)
Martin Delacourt, Benjamin Hellouin de Menibus
Construction of mu-Limit Sets of Two-dimensional Cellular Automata. STACS (2015)
Martin Delacourt, Benjamin Hellouin de Menibus
Characterisation of limit measures of higher-dimensional cellular automata. CoRR (2015)
Benjamin Hellouin de Menibus, Mathieu Sablik
Entry times in automata with simple defect dynamics AUTOMATA & JAC (2012)
Benjamin Hellouin de Menibus, Mathieu Sablik
Self-organization in Cellular Automata: A Particle-Based Approach. Developments in Language Theory (2011)
Benjamin Hellouin de Menibus, Takeaki Uno
Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width. TAMC (2011)