Related papers: On a class of highly symmetric Markov-Dyck shifts
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,…
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…
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…
We introduce notions of suspension and flow equivalence on one-sided topological Markov shifts, which we call one-sided suspension and one-sided flow equivalence, respectively. We prove that one-sided flow equivalence is equivalent to…
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…
We define the class of sofic-Dyck shifts which extends the class of Markov-Dyck shifts introduced by Inoue, Krieger and Matsumoto. Sofic-Dyck shifts are shifts of sequences whose finite factors form unambiguous context-free languages. We…
We introduce "puzzles of quasi-finite type" which are the counterparts of our subshifts of quasi-finite type (Invent. Math. 159 (2005)) in the setting of combinatorial puzzles as defined in complex dynamics. We are able to analyze these…
$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…
Topological entropy or spatial entropy is a way to measure the complexity of shift spaces. This study investigates the relationships between the spatial entropy and the various periodic entropies which are computed by skew-coordinated…
We study Markov multi-maps of the interval from the point of view of topological dynamics. Specifically, we investigate whether they have various properties, including topological transitivity, topological mixing, dense periodic points, and…
We study the neutral periodic points of the Markov-Dyck shifts of finite strongly connected directed graphs. Under certain hypothesis on the structure of the graphs we show, that the topological conjugacy of their Markov-Dyck shifts implies…
We consider families of coded systems that contain the Dyck shifts and that are closed under topological conjugacy. We introduce a notion of hyposynchronization of subshifts. We introduce a notion of restricted complexity of…
We introduce subshifts of quasi-finite type as a generalization of the well-known subshifts of finite type. This generalization is much less rigid and therefore contains the symbolic dynamics of many non-uniform systems, e.g., piecewise…
We will study several subgroups of continuous full groups of one-sided topological Markov shifts from the view points of cohomology groups of full group actions on the shift spaces. We also study continuous orbit equivalence and strongly…
We introduce the notion of induced topological pressure for countable state Markov shifts with respect to a non-negative scaling function and an arbitrary subset of finite words. Firstly, the scaling function allows a direct access to…
For continuously orbit equivalent one-sided topological Markov shifts $(X_A,\sigma_A)$ and $(X_B,\sigma_B)$, their eventually periodic points and cocycle functions are studied. As a result we directly construct an isomorphism between their…
We will characterize topological conjugate one-sided topological Markov shifts in terms of their subgroups of continuous full groups and subalgebras of Cuntz--Krieger algebras.
We study discrete flow equivalence of two-sided topological Markov shifts by using extended Ruelle algebras. We characterize flow equivalence of two-sided topological Markov shifts in terms of conjugacy of certain actions weighted by…
We will characterize topological conjugacy classes of one-sided topological Markov shifts in terms of the associated Cuntz--Krieger algebras and its gauge actions with potentials.