scientific article; zbMATH DE number 7650899

DOI10.4230/LIPICS.STACS.2020.14MaRDI QIDQ5874285FDOQ5874285

Authors: Jarkko Kari, Etienne Moutot 

Publication date: 7 February 2023

Full work available at URL: https://arxiv.org/abs/1904.01267

Title of this publication is not available (Why is that?)

zbMATH Keywords

symbolic dynamicsdecidabilityNivat's conjecturedomino problem2D subshiftslow pattern complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited In (5)

• Complexity of cutting words on regular tilings
• On periodic decompositions, one-sided nonexpansive directions and Nivat's conjecture
• Decidability and periodicity of low complexity tilings
• On periodic decompositions and nonexpansive lines
• Domino problem for pretty low complexity subshifts

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874285)