Go to the corresponding LIPIcs Volume Portal 
Kari, Jarkko ; Moutot, Etienne
pdfformat: 

@InProceedings{kari_et_al:LIPIcs:2020:11875, author = {Jarkko Kari and Etienne Moutot}, title = {{Decidability and Periodicity of Low Complexity Tilings}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {14:114:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771405}, ISSN = {18688969}, year = {2020}, volume = {154}, editor = {Christophe Paul and Markus Bl{\"a}ser}, publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/11875}, URN = {urn:nbn:de:0030drops118752}, doi = {10.4230/LIPIcs.STACS.2020.14}, annote = {Keywords: Nivat’s conjecture, domino problem, decidability, low pattern complexity, 2D subshifts, symbolic dynamics} }
Keywords:  Nivat’s conjecture, domino problem, decidability, low pattern complexity, 2D subshifts, symbolic dynamics  
Collection:  37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)  
Issue Date:  2020  
Date of publication:  04.03.2020 