Benjamin Hellouin de Menibus

32 papers A* 2A 3C 4Journal 20Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Decision problems on geometric tilings. Theor. Comput. Sci. Benjamin Hellouin de Menibus, Victor H. Lutfalla, Pascal Vanier
2025	A*	`conf`	Minimality and Computability of Languages of G-Shifts. ICALP Djamel Eddine Amir, Benjamin Hellouin de Menibus
2025	J	`jnl`	Minimality and computability of languages of G-shifts. CoRR Djamel Eddine Amir, Benjamin Hellouin de Menibus
2025	J	`jnl`	Parametrized complexity of relations between multidimensional subshifts. CoRR Nicanor Carrasco-Vargas, Benjamin Hellouin de Menibus, Rémi Pallen
2025	A	`conf`	Subshifts Defined by Nondeterministic and Alternating Plane-Walking Automata. STACS Benjamin Hellouin de Menibus, Pacôme Perrotin
2025	—	`conf`	Symbol Frequencies in Surjective Cellular Automata. AUTOMATA Benjamin Hellouin de Menibus, Ville Salo, Ilkka Törmä
2025	J	`jnl`	Undecidability of the block gluing classes of homshifts. CoRR Nishant Chandgotia, Silvère Gangloff, Benjamin Hellouin de Menibus, Piotr Oprocha
2024	J	`jnl`	Alternating hierarchy of sushifts defined by nondeterministic plane-walking automata. CoRR Benjamin Hellouin de Menibus, Pacôme Perrotin
2024	J	`jnl`	Decision problems on geometric tilings. CoRR Benjamin Hellouin de Menibus, Victor H. Lutfalla, Pascal Vanier
2024	J	`jnl`	String attractors and bi-infinite words. CoRR Pierre Béaur, France Gheeraert, Benjamin Hellouin de Menibus
2024	C	`conf`	Two-Player Domino Games. CiE Benjamin Hellouin de Menibus, Rémi Pallen
2023	—	`conf`	Sturmian and Infinitely Desubstitutable Words Accepted by an ømega-Automaton. WORDS Pierre Béaur, Benjamin Hellouin de Menibus
2023	J	`jnl`	Sturmian and infinitely desubstitutable words accepted by an ω-automaton. CoRR Pierre Béaur, Benjamin Hellouin de Menibus
2023	C	`conf`	The Domino Problem Is Undecidable on Every Rhombus Subshift. DLT Benjamin Hellouin de Menibus, Victor H. Lutfalla, Camille Noûs
2023	J	`jnl`	The Domino problem is undecidable on every rhombus subshift. CoRR Benjamin Hellouin de Menibus, Victor H. Lutfalla, Camille Noûs
2023	J	`jnl`	Two-player Domino games. CoRR Benjamin Hellouin de Menibus, Rémi Pallen
2022	A	`conf`	The Aperiodic Domino Problem in Higher Dimension. STACS Antonin Callard, Benjamin Hellouin de Menibus
2022	J	`jnl`	The aperiodic Domino problem in higher dimension. CoRR Antonin Callard, Benjamin Hellouin de Menibus
2018	A*	`conf`	Aperiodic Points in Z ICALP Anaël Grandjean, Benjamin Hellouin de Menibus, Pascal Vanier
2018	J	`jnl`	Aperiodic points in 𝒁 CoRR Anaël Grandjean, Benjamin Hellouin de Menibus, Pascal Vanier
2018	J	`jnl`	Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width. CoRR Benjamin Hellouin de Menibus, Takeaki Uno
2018	J	`jnl`	Nontrivial Turmites are Turing-universal. J. Cell. Autom. Diego Maldonado, Anahí Gajardo, Benjamin Hellouin de Menibus, Andrés Moreira
2017	J	`jnl`	Characterisation of Limit Measures of Higher-Dimensional Cellular Automata. Theory Comput. Syst. Martin Delacourt, Benjamin Hellouin de Menibus
2017	J	`jnl`	Characterizing Asymptotic Randomization in Abelian Cellular Automata. CoRR Benjamin Hellouin de Menibus, Ville Salo, Guillaume Theyssier
2017	J	`jnl`	Nontrivial Turmites are Turing-universal. CoRR Diego Maldonado, Anahí Gajardo, Benjamin Hellouin de Menibus, Andrés Moreira
2016	J	`jnl`	Computing the entropy of one-dimensional decidable subshifts. CoRR Silvère Gangloff, Benjamin Hellouin de Menibus
2016	J	`jnl`	Self-organisation in cellular automata with coalescent particles: Qualitative and quantitative approaches. CoRR Benjamin Hellouin de Menibus, Mathieu Sablik
2015	J	`jnl`	Characterisation of limit measures of higher-dimensional cellular automata. CoRR Martin Delacourt, Benjamin Hellouin de Menibus
2015	A	`conf`	Construction of mu-Limit Sets of Two-dimensional Cellular Automata. STACS Martin Delacourt, Benjamin Hellouin de Menibus
2012	—	`conf`	Entry times in automata with simple defect dynamics AUTOMATA & JAC Benjamin Hellouin de Menibus, Mathieu Sablik
2011	C	`conf`	Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width. TAMC Benjamin Hellouin de Menibus, Takeaki Uno
2011	C	`conf`	Self-organization in Cellular Automata: A Particle-Based Approach. Developments in Language Theory Benjamin Hellouin de Menibus, Mathieu Sablik