Related papers: S-limited shifts
The aim of this article is to find appropriate definitions for shifts of finite type and sofic shifts in a general context of symbolic dynamics. We start showing that the classical definitions of shifts of finite type and sofic shifts, as…
Let $S=\{s_i\in\mathbb N\cup\{0\}:0\leq s_i<s_{i+1}\}$ and let $d_{0}=s_{0}$ and $\Delta(S)=\{d_{n}\}_{n}$ where $d_{n}=s_{n}-s_{n-1}$. In this note, we show that an $S$-gap shift is subshift of finite type (SFT) if and only if $S$ is…
We study the dynamical properties of certain shift spaces. To help study these properties we introduce two new classes of shifts, namely boundedly supermultiplicative (BSM) shifts and balanced shifts. It turns out that any almost specified…
The $S$-gap shifts have a dynamically and combinatorially rich structure. Dynamical properties of the $S$-gap shift can be related to the properties of the set $S$. This interplay is particularly interesting when $S$ is not syndetic such as…
In this paper, we consider different classes of subshifts and study their perturbations obtained by forbidding sequences that contain a given word as a subword. We show that the perturbations of sofic shifts are sofic. Though not true for…
$S$-gap shifts are a well-studied class of shift spaces, which has led to several proposed generalizations. This paper introduces a new class of shift spaces called $\mathcal{S}$-graph shifts whose essential structure is encoded in a novel…
In this work, we prove that every SFT, sofic shift, and strongly irreducible shift on locally finite groups has strong dynamical properties. These properties include that every sofic shift is an SFT, every SFT is strongly irreducible, every…
Dendric shifts are defined by combinatorial restrictions of the extensions of the words in their languages. This family generalizes well-known families of shifts such as Sturmian shifts, Arnoux-Rauzy shifts and codings of interval exchange…
We study ergodic-theoretic properties of coded shift spaces. A coded shift space is defined as a closure of all bi-infinite concatenations of words from a fixed countable generating set. We derive sufficient conditions for the uniqueness of…
If $\mathcal{A}$ is a finite set (alphabet), the shift dynamical system consists of the space $\mathcal{A}^{\mathbb{N}}$ of sequences with entries in $\mathcal{A}$, along with the left shift operator $S$. Closed $S$-invariant subsets are…
Given an SFT $\Sigma$ and a finite set $S$ of finite words, let $\Sigma\langle S\rangle$ denote the subshift of $\Sigma$ that avoids $S$. We establish a general criterion under which we can bound the entropy perturbation…
We consider shift spaces in which elements of the alphabet may overlap nontransitively. We define a notion of entropy for such spaces, give several techniques for computing lower bounds for it, and show that it is equal to a limit of…
We show that the values of entropies of multidimensional shifts of finite type (SFTs) are characterized by a certain computation-theoretic property: a real number $h\geq 0$ is the entropy of such an SFT if and only if it is right…
We define a notion of (one-sided) shift spaces over infinite alphabets. Unlike many previous approaches to shift spaces over countable alphabets, our shift spaces are compact Hausdorff spaces. We examine shift morphisms between these shift…
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…
In this work, we treat subshifts, defined in terms of an alphabet $A$ and (usually infinite) forbidden list $F$, where the number of $n$-letter words in $F$ has "slow growth rate" in $n$. We show that such subshifts are well-behaved in…
In this work we study the entropies of subsystems of shifts of finite type (SFTs) and sofic shifts on countable amenable groups. We prove that for any countable amenable group $G$, if $X$ is a $G$-SFT with positive topological entropy $h(X)…
Given a one-sided subshift $X$ on a finite alphabet, we consider the semigroup $S_X =L_X \cup \{0\}$, where $L_X $ is the language of $X $, equipped with the multiplication operation given by concatenation, when allowed, and set to vanish…
In this paper we further develop the theory of one sided shift spaces over infinite alphabets, characterizing one-step shifts as edge shifts of ultragraphs and partially answering a conjecture regarding shifts of finite type (we show that…
The automorphism group of a one dimensional shift space over a finite alphabet exhibits different types of behavior: for a large class with positive entropy, it contains a rich collection of subgroups, while for many shifts of zero entropy,…