default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEtienne Moutot
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]Jarkko Kari
, Etienne Moutot:
Decidability and Periodicity of Low Complexity Tilings. Theory Comput. Syst. 67(1): 125-148 (2023)- [c6]Titouan Carette, Etienne Moutot, Thomas Perez, Renaud Vilmart:
Compositionality of Planar Perfect Matchings: A Universal and Complete Fragment of ZW-Calculus. ICALP 2023: 120:1-120:17 - 2022
- [j5]Solène J. Esnay, Etienne Moutot:
Aperiodic SFTs on Baumslag-Solitar groups. Theor. Comput. Sci. 917: 31-50 (2022) - 2021
- [j4]Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz:
Computational limitations of affine automata and generalized affine automata. Nat. Comput. 20(2): 259-270 (2021) - [j3]Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz:
Correction to: Computational limitations of affine automata and generalized affine automata. Nat. Comput. 20(2): 271 (2021) - [i8]Etienne Moutot, Coline Petit-Jean:
Pattern Complexity of Aperiodic Substitutive Subshifts. CoRR abs/2105.00784 (2021) - 2020
- [b1]Etienne Moutot:
Around the Domino Problem - Combinatorial Structures and Algebraic Tools. (Autour du problème du Domino - Structures combinatoires et outils algébriques). University of Turku, Finland, 2020 - [j2]Emmanuel Jeandel, Etienne Moutot, Pascal Vanier:
Slopes of Multidimensional Subshifts. Theory Comput. Syst. 64(1): 35-61 (2020) - [c5]Jarkko Kari, Etienne Moutot:
Decidability and Periodicity of Low Complexity Tilings. STACS 2020: 14:1-14:12 - [i7]Julien Esnay, Etienne Moutot:
Weakly and Strongly Aperiodic Subshifts of Finite Type on Baumslag-Solitar Groups. CoRR abs/2004.02534 (2020)
2010 – 2019
- 2019
- [j1]Jarkko Kari, Etienne Moutot:
Nivat's conjecture and pattern complexity in algebraic subshifts. Theor. Comput. Sci. 777: 379-386 (2019) - [c4]Nathalie Aubrun, Sebastián Barbieri, Etienne Moutot:
The Domino Problem is Undecidable on Surface Groups. MFCS 2019: 46:1-46:14 - [c3]Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz:
Computational Limitations of Affine Automata. UCNC 2019: 108-121 - [i6]Jarkko Kari, Etienne Moutot:
Decidability and Periodicity of Low Complexity Tilings. CoRR abs/1904.01267 (2019) - [i5]Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz:
Computational Limitations of Affine Automata. CoRR abs/1904.02428 (2019) - 2018
- [c2]Etienne Moutot, Pascal Vanier:
Slopes of 3-Dimensional Subshifts of Finite Type. CSR 2018: 257-268 - [i4]Etienne Moutot, Pascal Vanier:
Slopes of 3-dimensional Subshifts of Finite Type. CoRR abs/1806.07101 (2018) - [i3]Jarkko Kari, Etienne Moutot:
Nivat's Conjecture and Pattern Complexity in Algebraic Subshifts. CoRR abs/1806.07107 (2018) - [i2]Nathalie Aubrun, Sebastián Barbieri, Etienne Moutot:
The domino problem is undecidable on surface groups. CoRR abs/1811.08420 (2018) - 2017
- [c1]Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz:
On the Computational Power of Affine Automata. LATA 2017: 405-417 - 2016
- [i1]Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz:
On the computational power of affine automata. CoRR abs/1612.01870 (2016)
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-04-25 05:41 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:
