On the expressive power of quasiperiodic SFT - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2017

On the expressive power of quasiperiodic SFT

Abstract

In this paper we study the shifts, which are the shift-invariant and topologically closed sets of configurations over a finite alphabet in $\mathbb{Z}^d$. The minimal shifts are those shifts in which all configurations contain exactly the same patterns. Two classes of shifts play a prominent role in symbolic dynamics, in language theory and in the theory of computability: the shifts of finite type (obtained by forbidding a finite number of finite patterns) and the effective shifts (obtained by forbidding a computably enumerable set of finite patterns). We prove that every effective minimal shift can be represented as a factor of a projective subdynamics on a minimal shift of finite type in a bigger (by $1$) dimension. This result transfers to the class of minimal shifts a theorem by M.Hochman known for the class of all effective shifts and thus answers an open question by E.Jeandel. We prove a similar result for quasiperiodic shifts and also show that there exists a quasiperiodic shift of finite type for which Kolmogorov complexity of all patterns of size $n\times n$ is $\Omega(n)$.
Fichier principal
Vignette du fichier
LIPIcs-MFCS-2017-5.pdf (481.52 Ko) Télécharger le fichier
Loading...

Dates and versions

lirmm-01623207 , version 1 (25-10-2017)

Licence

Attribution

Identifiers

Cite

Andrei Romashchenko, Bruno Durand. On the expressive power of quasiperiodic SFT. MFCS 2017 - 42nd International Symposium on Mathematical Foundations of Computer Science, Aug 2017, Aalborg, Denmark. pp.5:1-5:14, ⟨10.4230/LIPIcs.MFCS.2017.5⟩. ⟨lirmm-01623207⟩
139 View
25 Download

Altmetric

Share

Gmail Facebook X LinkedIn More