default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Delacourt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i6]Olivier Carton, Jean-Michel Couvreur, Martin Delacourt, Nicolas Ollinger:
Addition in Dumont-Thomas Numeration Systems in Theory and Practice. CoRR abs/2406.09868 (2024)- 2021
- [c8]Martin Delacourt:
Rice's Theorem for Generic Limit Sets of Cellular Automata. AUTOMATA 2021: 6:1-6:12 - [i5]Martin Delacourt:
Rice's theorem for generic limit sets of cellular automata. CoRR abs/2106.07907 (2021)
2010 – 2019
- 2017
- [j4]Martin Delacourt
, Benjamin Hellouin de Menibus:
Characterisation of Limit Measures of Higher-Dimensional Cellular Automata. Theory Comput. Syst. 61(4): 1178-1213 (2017) - [c7]Martin Delacourt, Nicolas Ollinger:
Permutive One-Way Cellular Automata and the Finiteness Problem for Automaton Groups. CiE 2017: 234-245 - 2015
- [j3]Laurent Boyer, Martin Delacourt, Victor Poupet, Mathieu Sablik, Guillaume Theyssier:
μ-Limit sets of cellular automata from a computational complexity perspective. J. Comput. Syst. Sci. 81(8): 1623-1647 (2015) - [c6]Martin Delacourt, Benjamin Hellouin de Menibus:
Construction of mu-Limit Sets of Two-dimensional Cellular Automata. STACS 2015: 262-274 - [i4]Martin Delacourt, Benjamin Hellouin de Menibus:
Characterisation of limit measures of higher-dimensional cellular automata. CoRR abs/1512.03696 (2015) - 2013
- [c5]Petr Kurka, Martin Delacourt:
The Unary Arithmetical Algorithm in Bimodular Number Systems. IEEE Symposium on Computer Arithmetic 2013: 127-134 - [i3]Laurent Boyer, Martin Delacourt, Victor Poupet, Mathieu Sablik, Guillaume Theyssier:
μ-Limit Sets of Cellular Automata from a Computational Complexity Perspective. CoRR abs/1309.6730 (2013) - 2012
- [c4]Martin Delacourt, Petr Kurka:
Finite State Transducers for Modular Möbius Number Systems. MFCS 2012: 323-334 - 2011
- [j2]Martin Delacourt, Victor Poupet, Mathieu Sablik, Guillaume Theyssier:
Directional dynamics along arbitrary curves in cellular automata. Theor. Comput. Sci. 412(30): 3800-3821 (2011) - [c3]Martin Delacourt:
Rice's Theorem for μ-Limit Sets of Cellular Automata. ICALP (2) 2011: 89-100 - 2010
- [c2]Laurent Boyer, Martin Delacourt, Mathieu Sablik:
Construction of µ-limit Sets. JAC 2010: 76-87 - [i2]Martin Delacourt, Victor Poupet, Mathieu Sablik, Guillaume Theyssier:
Directional Dynamics along Arbitrary Curves in Cellular Automata. CoRR abs/1001.5470 (2010) - [i1]Laurent Boyer, Martin Delacourt, Mathieu Sablik:
Construction of μ-Limit Sets. CoRR abs/1012.1333 (2010)
2000 – 2009
- 2009
- [j1]Martin Delacourt, Marcus Pivato:
Emergent Defect Dynamics in Two-Dimensional Cellular Automata. J. Cell. Autom. 4(2): 111-124 (2009) - 2007
- [c1]Martin Delacourt, Victor Poupet:
Real Time Language Recognition on 2D Cellular Automata: Dealing with Non-convex Neighborhoods. MFCS 2007: 298-309
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 2024-07-11 20:17 CEST 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:
