Benjamin Hellouin de Menibus

According to our database, Benjamin Hellouin de Menibus authored at least 18 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

Decision problems on geometric tilings.

Benjamin Hellouin de Menibus, Victor H. Lutfalla, Pascal Vanier

CoRR, 2024

Alternating hierarchy of sushifts defined by nondeterministic plane-walking automata.

Benjamin Hellouin de Menibus, Pacôme Perrotin

CoRR, 2024

String attractors and bi-infinite words.

Pierre Béaur, France Gheeraert, Benjamin Hellouin de Menibus

CoRR, 2024

Two-Player Domino Games.

Benjamin Hellouin de Menibus, Rémi Pallen

Proceedings of the Twenty Years of Theoretical and Practical Synergies, 2024

2023

Sturmian and infinitely desubstitutable words accepted by an ω-automaton.

Pierre Béaur, Benjamin Hellouin de Menibus

CoRR, 2023

The Domino Problem Is Undecidable on Every Rhombus Subshift.

Benjamin Hellouin de Menibus, Victor H. Lutfalla, Camille Noûs

Proceedings of the Developments in Language Theory - 27th International Conference, 2023

Sturmian and Infinitely Desubstitutable Words Accepted by an ømega-Automaton.

Pierre Béaur, Benjamin Hellouin de Menibus

Proceedings of the Combinatorics on Words - 14th International Conference, 2023

2022

The Aperiodic Domino Problem in Higher Dimension.

Antonin Callard, Benjamin Hellouin de Menibus

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2018

Nontrivial Turmites are Turing-universal.

Diego Maldonado, Anahí Gajardo, Benjamin Hellouin de Menibus, Andrés Moreira

J. Cell. Autom., 2018

Aperiodic Points in Z²-subshifts.

Anaël Grandjean, Benjamin Hellouin de Menibus, Pascal Vanier

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Characterisation of Limit Measures of Higher-Dimensional Cellular Automata.

Martin Delacourt, Benjamin Hellouin de Menibus

Theory Comput. Syst., 2017

Characterizing Asymptotic Randomization in Abelian Cellular Automata.

Benjamin Hellouin de Menibus, Ville Salo, Guillaume Theyssier

CoRR, 2017

2016

Self-organisation in cellular automata with coalescent particles: Qualitative and quantitative approaches.

Benjamin Hellouin de Menibus, Mathieu Sablik

CoRR, 2016

Computing the entropy of one-dimensional decidable subshifts.

Silvère Gangloff, Benjamin Hellouin de Menibus

CoRR, 2016

2015

Construction of mu-Limit Sets of Two-dimensional Cellular Automata.

Martin Delacourt, Benjamin Hellouin de Menibus

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2012

Entry times in automata with simple defect dynamics

Benjamin Hellouin de Menibus, Mathieu Sablik

Proceedings of the Proceedings 18th international workshop on Cellular Automata and Discrete Complex Systems and 3rd international symposium Journées Automates Cellulaires, 2012

2011

Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width.

Benjamin Hellouin de Menibus, Takeaki Uno

Proceedings of the Theory and Applications of Models of Computation, 2011

Self-organization in Cellular Automata: A Particle-Based Approach.

Benjamin Hellouin de Menibus, Mathieu Sablik

Proceedings of the Developments in Language Theory - 15th International Conference, 2011