1D Effectively Closed Subshifts and 2D Tilings
Discrete Mathematics
2010-12-08 v1 Formal Languages and Automata Theory
Abstract
Michael Hochman showed that every 1D effectively closed subshift can be simulated by a 3D subshift of finite type and asked whether the same can be done in 2D. It turned out that the answer is positive and necessary tools were already developed in tilings theory. We discuss two alternative approaches: first, developed by N. Aubrun and M. Sablik, goes back to Leonid Levin; the second one, developed by the authors, goes back to Peter Gacs.
Cite
@article{arxiv.1012.1329,
title = {1D Effectively Closed Subshifts and 2D Tilings},
author = {Durand Bruno and Alexander Shen and Andrei Romashchenko},
journal= {arXiv preprint arXiv:1012.1329},
year = {2010}
}
Comments
Journ\'ees Automates Cellulaires, Turku : Finland (2010)