Author of the publication

Decidability and Periodicity of Low Complexity Tilings.

, and . STACS, volume 154 of LIPIcs, page 14:1-14:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Around the Domino Problem - Combinatorial Structures and Algebraic Tools. (Autour du problème du Domino - Structures combinatoires et outils algébriques).. University of Lyon, France, (2020)On the computational power of affine automata., , and . CoRR, (2016)Pattern Complexity of Aperiodic Substitutive Subshifts., and . CoRR, (2021)Compositionality of Planar Perfect Matchings: A Universal and Complete Fragment of ZW-Calculus., , , and . ICALP, volume 261 of LIPIcs, page 120:1-120:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)The Domino Problem is Undecidable on Surface Groups., , and . MFCS, volume 138 of LIPIcs, page 46:1-46:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Decidability and Periodicity of Low Complexity Tilings., and . STACS, volume 154 of LIPIcs, page 14:1-14:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Decidability and Periodicity of Low Complexity Tilings., and . CoRR, (2019)Computational Limitations of Affine Automata., , and . UCNC, volume 11493 of Lecture Notes in Computer Science, page 108-121. Springer, (2019)Slopes of 3-Dimensional Subshifts of Finite Type., and . CSR, volume 10846 of Lecture Notes in Computer Science, page 257-268. Springer, (2018)On the Computational Power of Affine Automata., , and . LATA, volume 10168 of Lecture Notes in Computer Science, page 405-417. (2017)