10 citations · 18 across the 6 of their papers we have counts for
10 papers
Compositionality of planar perfect matchings
Titouan Carette, Etienne Moutot, Thomas Perez +1
We exhibit a strong connection between the matchgate formalism introduced by Valiant and the ZW-calculus of Coecke and Kissinger. This connection provides a natural compositional f…
Aperiodicity in Quantum Wang Tilings
Titouan Carette, Etienne Moutot
By reformulating Wang tiles with tensors, we propose a natural generalization to the probabilistic and quantum setting. In this new framework, we introduce notions of tilings and p…
Pattern Complexity of Aperiodic Substitutive Subshifts
Etienne Moutot, Coline Petit-Jean
This paper aims to better understand the link better understand the links between aperiodicity in subshifts and pattern complexity. Our main contribution deals with substitutive su…
Weakly and Strongly Aperiodic Subshifts of Finite Type on Baumslag-Solitar Groups
Solène J. Esnay, Etienne Moutot
We study the periodicity of subshifts of finite type (SFT) on Baumslag-Solitar groups. We show that for residually finite Baumslag-Solitar groups there exist both strongly and weak…
Computational Limitations of Affine Automata
Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryılmaz
We present two new results on the computational limitations of affine automata. First, we show that the computation of bounded-error rational-values affine automata is simulated in…
Decidability and Periodicity of Low Complexity Tilings
Jarkko Kari, Etienne Moutot
In this paper we study colorings (or tilings) of the two-dimensional grid . A coloring is said to be valid with respect to a set of rectangular patter…
The domino problem is undecidable on surface groups
Nathalie Aubrun, Sebastián Barbieri, Etienne Moutot
We show that the domino problem is undecidable on orbit graphs of non-deterministic substitutions which satisfy a technical property. As an application, we prove that the domino pr…
Nivat's Conjecture and Pattern Complexity in Algebraic Subshifts
Jarkko Kari, Etienne Moutot
We study Nivat's conjecture on algebraic subshifts and prove that in some of them every low complexity configuration is periodic. This is the case in the Ledrappier subshift (the 3…
Slopes of 3-dimensional Subshifts of Finite Type
Etienne Moutot, Pascal Vanier
In this paper we study the directions of periodicity of three-dimensional subshifts of finite type (SFTs) and in particular their slopes. A configuration of a subshift has a slope…
On the computational power of affine automata
Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryılmaz
We investigate the computational power of affine automata (AfAs) introduced in [4]. In particular, we present a simpler proof for how to change the cutpoint for any affine language…