Related papers: Sofic-Dyck shifts
We prove that the multivariate zeta function of a sofic-Dyck shift is the commutative series of some visibly pushdown language. As a consequence the zeta function of a sofic-Dyck shift is the generating function of a visibly pushdown…
We introduce a class of coded systems that we construct from sofic systems and Dyck shifts and we study a class of subshifts that we obtain by excluding words of length two from Dyck shifts. We derive expressions for zeta functions and…
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…
A class of highly symmetric Markov-Dyck shifts is introduced. Topological entropies and zeta functions are determined.
The Markov-Dyck shifts arise from finite directed graphs. An expression for the zeta function of a Markov-Dyck shift is given. The derivation of this expression is based on a formula in Keller (G. Keller, {\it Circular codes, loop counting,…
We study some basic properties of sofic-Dyck shifts and finite-type-Dyck shifts. We prove that the class of sofic-Dyck shifts is stable under proper conjugacies. We prove a Decomposition Theorem of a proper conjugacy between edge-Dyck…
For a given finite directed graph $G$, there are two types of Markov-Dyck shifts, the Markov-Dyck shift $D_G^V$ of vertex type and the Markov-Dyck shift $D_G^E$ of edge type. It is shown that, if $G$ does not have multi-edges, the former is…
We discuss a method of calculating the zeta function of subshifts which have a presentation by a finite directed graph labeled by elements of the associated inverse semigroup. This class of subshifts is introduced as a class of property A…
The class of periodic-finite-type shifts (PFT's) is a class of sofic shifts that strictly includes the class of shifts of finite type (SFT's), and the zeta function of a PFT is a generating function for the number of periodic sequences in…
A sofic shift is a shift space consisting of bi-infinite labels of paths from a labelled graph. Being a dynamical system, the distribution of its closed orbits may indicate the complexity of the space. For this purpose, prime orbit and…
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…
Sofic shifts are symbolic dynamical systems defined by the set of bi-infinite sequences on an edge-labeled directed graph, called a presentation. We study the computational complexity of an array of natural decision problems about…
We introduce a new type of shift dynamics as an extended model of symbolic dynamics, and investigate the characteristics of shift spaces from the viewpoints of both dynamics and computation. This shift dynamics is called a functional shift…
The study of subshifts on groups different from $\mathbb{Z}$, such as $\mathbb{Z}^d$, $d\geq 2$, has been a subject of intense research in recent years. These investigations have unveiled aremarkable connection between dynamics and…
We prove that the Karoubi envelope of a shift --- defined as the Karoubi envelope of the syntactic semigroup of the language of blocks of the shift --- is, up to natural equivalence of categories, an invariant of flow equivalence. More…
We classify certain sofic shifts (the irreducible Point Extension Type, or PET, sofic shifts) up to flow equivalence, using invariants of the canonical Fischer cover. There are two main ingredients: (1) An extension theorem, for extending…
$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…
The class of normal subshifts includes irreducible infinite topological Markov shifts, irreducible infinite sofic shifts, synchronized systems, Dyck shifts, $\beta$-shifts, substitution minimal shifts, and so on. We will characterize…
Indexed languages are a generalization of context-free languages and form a proper subset of context-sensitive languages. We propose to generalize to indexed languages several well known characterizations of context-free languages: namely,…
In this paper, we explore the construction and dynamical properties of $\mathcal{S}$-limited shifts. An $S$-limited shift is a subshift defined on a finite alphabet $\mathcal{A} = \{1, \ldots,p\}$ by a set $\mathcal{S} = \{S_1, \ldots,…