Countable Sofic Shifts with a Periodic Direction-Reference-Cited by-同舟云学术

Countable Sofic Shifts with a Periodic Direction

Published:2019-12-27 Issue:6 Volume:64 Page:1042-1066
ISSN:1432-4350
Container-title:Theory of Computing Systems
language:en
Short-container-title:Theory Comput Syst

Author:

Törmä Ilkka^ORCID

Abstract

AbstractAs a variant of the equal entropy cover problem, we ask whether all multidimensional sofic shifts with countably many configurations have SFT covers with countably many configurations. We answer this question in the negative by presenting explicit counterexamples. We formulate necessary conditions for a vertically periodic shift space to have a countable SFT cover, and prove that they are sufficient in a natural (but quite restricted) subclass of shift spaces.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00224-019-09962-8.pdf

Reference18 articles.

1. Aubrun, N., Sablik, M.: Simulation of effective subshifts by two-dimensional subshifts of finite type. Acta Appl. Math. 126(1), 35–63 (2013)

2. Ballier, A., Durand, B., Jeandel, E.: Structural aspects of tilings. In: Albers, P.W.S. (ed.) Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science, p 11. IBFI Schloss Dagstuhl, Bordeaux (2008)

3. Desai, A.: Subsystem entropy for $\mathbb {Z}^{d}$ sofic shifts. Indag. Math. (N.S.) 17(3), 353–359 (2006)

4. Destombes, J., Romashchenko, A.: Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional Shifts. Arxiv e-prints (2018)

5. Durand, B., Levin, L.A., Shen, A.: Complex tilings. J. Symbol. Log. 73, 593–613, 6 (2008)