default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenjamin Hellouin de Menibus
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Benjamin Hellouin de Menibus
, Rémi Pallen:
Two-Player Domino Games. CiE 2024: 139-152- [i14]Pierre Béaur, France Gheeraert, Benjamin Hellouin de Menibus:
String attractors and bi-infinite words. CoRR abs/2403.13449 (2024) - [i13]Benjamin Hellouin de Menibus, Pacôme Perrotin:
Alternating hierarchy of sushifts defined by nondeterministic plane-walking automata. CoRR abs/2409.08024 (2024) - [i12]Benjamin Hellouin de Menibus, Victor H. Lutfalla, Pascal Vanier:
Decision problems on geometric tilings. CoRR abs/2409.11739 (2024) - 2023
- [c8]Pierre Béaur, Benjamin Hellouin de Menibus:
Sturmian and Infinitely Desubstitutable Words Accepted by an ømega-Automaton. WORDS 2023: 104-116 - [c7]Benjamin Hellouin de Menibus, Victor H. Lutfalla, Camille Noûs:
The Domino Problem Is Undecidable on Every Rhombus Subshift. DLT 2023: 100-112 - [i11]Benjamin Hellouin de Menibus, Victor H. Lutfalla, Camille Noûs:
The Domino problem is undecidable on every rhombus subshift. CoRR abs/2302.12086 (2023) - [i10]Pierre Béaur, Benjamin Hellouin de Menibus:
Sturmian and infinitely desubstitutable words accepted by an ω-automaton. CoRR abs/2303.11133 (2023) - [i9]Benjamin Hellouin de Menibus, Rémi Pallen:
Two-player Domino games. CoRR abs/2310.19759 (2023) - 2022
- [c6]Antonin Callard, Benjamin Hellouin de Menibus:
The Aperiodic Domino Problem in Higher Dimension. STACS 2022: 19:1-19:15 - [i8]Antonin Callard, Benjamin Hellouin de Menibus:
The aperiodic Domino problem in higher dimension. CoRR abs/2202.07377 (2022)
2010 – 2019
- 2018
- [j2]Diego Maldonado, Anahí Gajardo, Benjamin Hellouin de Menibus, Andrés Moreira:
Nontrivial Turmites are Turing-universal. J. Cell. Autom. 13(5-6): 373-392 (2018) - [c5]Anaël Grandjean, Benjamin Hellouin de Menibus, Pascal Vanier:
Aperiodic Points in Z2-subshifts. ICALP 2018: 128:1-128:13 - [i7]Anaël Grandjean, Benjamin Hellouin de Menibus, Pascal Vanier:
Aperiodic points in 𝒁2-subshifts. CoRR abs/1805.08829 (2018) - [i6]Benjamin Hellouin de Menibus, Takeaki Uno:
Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width. CoRR abs/1806.00791 (2018) - 2017
- [j1]Martin Delacourt, Benjamin Hellouin de Menibus:
Characterisation of Limit Measures of Higher-Dimensional Cellular Automata. Theory Comput. Syst. 61(4): 1178-1213 (2017) - [i5]Diego Maldonado, Anahí Gajardo, Benjamin Hellouin de Menibus, Andrés Moreira:
Nontrivial Turmites are Turing-universal. CoRR abs/1702.05547 (2017) - [i4]Benjamin Hellouin de Menibus, Ville Salo, Guillaume Theyssier:
Characterizing Asymptotic Randomization in Abelian Cellular Automata. CoRR abs/1703.07289 (2017) - 2016
- [i3]Benjamin Hellouin de Menibus, Mathieu Sablik:
Self-organisation in cellular automata with coalescent particles: Qualitative and quantitative approaches. CoRR abs/1602.06093 (2016) - [i2]Silvère Gangloff, Benjamin Hellouin de Menibus:
Computing the entropy of one-dimensional decidable subshifts. CoRR abs/1602.06166 (2016) - 2015
- [c4]Martin Delacourt, Benjamin Hellouin de Menibus:
Construction of mu-Limit Sets of Two-dimensional Cellular Automata. STACS 2015: 262-274 - [i1]Martin Delacourt, Benjamin Hellouin de Menibus:
Characterisation of limit measures of higher-dimensional cellular automata. CoRR abs/1512.03696 (2015) - 2012
- [c3]Benjamin Hellouin de Menibus, Mathieu Sablik:
Entry times in automata with simple defect dynamics. AUTOMATA & JAC 2012: 97-109 - 2011
- [c2]Benjamin Hellouin de Menibus, Mathieu Sablik:
Self-organization in Cellular Automata: A Particle-Based Approach. Developments in Language Theory 2011: 251-263 - [c1]Benjamin Hellouin de Menibus, Takeaki Uno:
Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width. TAMC 2011: 483-494
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
