Plane-Walking Automata
Formal Languages and Automata Theory
2014-08-29 v1
Abstract
In this article, we study classes of multidimensional subshifts defined by multihead finite automata, in particular the hierarchy of classes of subshifts defined as the number of heads grows. The hierarchy collapses on the third level, where all co-recursively enumerable subshifts are obtained in every dimension. We also compare these classes to SFTs and sofic shifts. We are unable to separate the second and third level of the hierarchy in one and two dimensions, and suggest a related open problem for two-counter machines.
Keywords
Cite
@article{arxiv.1408.6701,
title = {Plane-Walking Automata},
author = {Ville Salo and Ilkka Törmä},
journal= {arXiv preprint arXiv:1408.6701},
year = {2014}
}
Comments
17 pages, 3 figures. To appear in a shortened from in the postceedings of AUTOMATA 2014, published by Springer