| Characterization of sets of limit measures of a cellular automaton iterated on a random configuration B Hellouin de Menibus, M Sablik | 23* | |
| Effect of quantified irreducibility on the computability of subshift entropy S Gangloff, BH De Menibus arXiv preprint arXiv:1602.06166, 2016 | 14 | 2016 |
| Asymptotic behaviour of cellular automata: computation and randomness BH de Menibus | 11 | 2014 |
| Aperiodic points in -subshifts A Grandjean, BH de Menibus, P Vanier arXiv preprint arXiv:1805.08829, 2018 | 7 | 2018 |
| Self-organisation in cellular automata with coalescent particles: qualitative and quantitative approaches B Hellouin de Menibus, M Sablik Journal of Statistical Physics 167, 1180-1220, 2017 | 6 | 2017 |
| The aperiodic Domino problem in higher dimension A Callard, BH de Menibus arXiv preprint arXiv:2202.07377, 2022 | 5 | 2022 |
| Characterizing asymptotic randomization in abelian cellular automata BH De Menibus, V Salo, G Theyssier Ergodic Theory and Dynamical Systems 40 (4), 923-952, 2020 | 5 | 2020 |
| Characterisation of limit measures of higher-dimensional cellular automata M Delacourt, B Hellouin de Menibus Theory of Computing Systems 61, 1178-1213, 2017 | 5 | 2017 |
| Self-organization in cellular automata: a particle-based approach B Hellouin de Menibus, M Sablik Developments in Language Theory, 251-263, 2011 | 5 | 2011 |
| Necessary conditions for tiling finitely generated amenable groups BH de Menibus, HM Cornejo arXiv preprint arXiv:1904.03907, 2019 | 4 | 2019 |
| Nontrivial turmites are Turing-universal D Maldonado, A Gajardo, BH de Menibus, A Moreira arXiv preprint arXiv:1702.05547, 2017 | 4 | 2017 |
| The Domino problem is undecidable on every rhombus subshift B Hellouin de Menibus, VH Lutfalla, C Noûs International Conference on Developments in Language Theory, 100-112, 2023 | 3 | 2023 |
| Construction of mu-Limit Sets of Two-dimensional Cellular Automata M Delacourt, B Hellouin de Ménibus 32nd International Symposium on Theoretical Aspects of Computer Science …, 2015 | 3 | 2015 |
| Maximal matching and path matching counting in polynomial time for graphs of bounded clique width B Hellouin de Menibus, T Uno Theory and Applications of Models of Computation, 483-494, 2011 | 3* | 2011 |
| Asymptotic behaviour of the one-dimensional “rock–paper–scissors” cyclic cellular automaton B Hellouin de Menibus, Y Le Borgne The Annals of Applied Probability 31 (5), 2420-2440, 2021 | 2 | 2021 |
| String attractors and bi-infinite words P Béaur, F Gheeraert, BH de Menibus arXiv preprint arXiv:2403.13449, 2024 | 1 | 2024 |
| Sturmian and Infinitely Desubstitutable Words Accepted by an -Automaton P Béaur, B Hellouin de Menibus International Conference on Combinatorics on Words, 104-116, 2023 | 1 | 2023 |
| Entry times in automata with simple defect dynamics B Hellouin de Menibus, M Sablik arXiv preprint arXiv:1208.2757, 2012 | 1 | 2012 |
| Two-Player Domino Games B Hellouin de Menibus, R Pallen Conference on Computability in Europe, 139-152, 2024 | | 2024 |
| Short-range and long-range order: a transition in block-gluing behavior in Hom shifts S Gangloff, BH de Menibus, P Oprocha arXiv preprint arXiv:2211.04075, 2022 | | 2022 |
