Etienne Moutot

Orcid: 0000-0003-2073-4709

According to our database1, Etienne Moutot authored at least 14 papers between 2017 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Decidability and Periodicity of Low Complexity Tilings.
Theory Comput. Syst., February, 2023

Compositionality of Planar Perfect Matchings: A Universal and Complete Fragment of ZW-Calculus.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
Aperiodic SFTs on Baumslag-Solitar groups.
Theor. Comput. Sci., 2022

2021
Correction to: Computational limitations of affine automata and generalized affine automata.
Nat. Comput., 2021

Computational limitations of affine automata and generalized affine automata.
Nat. Comput., 2021

Pattern Complexity of Aperiodic Substitutive Subshifts.
CoRR, 2021

2020
Around the Domino Problem - Combinatorial Structures and Algebraic Tools. (Autour du problème du Domino - Structures combinatoires et outils algébriques).
PhD thesis, 2020

Slopes of Multidimensional Subshifts.
Theory Comput. Syst., 2020

Weakly and Strongly Aperiodic Subshifts of Finite Type on Baumslag-Solitar Groups.
CoRR, 2020

2019
Nivat's conjecture and pattern complexity in algebraic subshifts.
Theor. Comput. Sci., 2019

Computational Limitations of Affine Automata.
Proceedings of the Unconventional Computation and Natural Computation, 2019

The Domino Problem is Undecidable on Surface Groups.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018
Slopes of 3-Dimensional Subshifts of Finite Type.
Proceedings of the Computer Science - Theory and Applications, 2018

2017
On the Computational Power of Affine Automata.
Proceedings of the Language and Automata Theory and Applications, 2017


  Loading...