Related papers: On certain one-counter shifts
We introduce a class of subshifts under the name of "standard one-counter shifts". The standard one-counter shifts are the Markov coded systems of certain Markov codes that belong to the family of one-counter languages. We study topological…
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…
Recently Ott, Tomforde and Willis introduced a notion of one-sided shifts over infinite alphabets and proposed a definition for sliding block codes between such shift spaces. In this work we propose a more general definition for sliding…
A class of highly symmetric Markov-Dyck shifts is introduced. Topological entropies and zeta functions are determined.
The classification of homogeneous scalar weighted shifts is known. Recently, Kor\'{a}nyi obtained a large class of inequivalent irreducible homogeneous bi-lateral $2$-by-$2$ block shifts. In this paper, we construct two distinct classes of…
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 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…
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…
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…
A multidimensional sofic shift is called countably covered if it has an SFT cover containing only countably many configurations. In contrast to the one-dimensional setting, not all countable sofic shifts are countably covered. We…
We discuss the set of subgroups of the automorphism group of a full shift, and submonoids of its endomorphism monoid. We prove closure under direct products in the monoid case, and free products in the group case. We also show that the…
We consider a class of discontinuous piecewise linear differential systems in $\mathbb{R}^3$ with two pieces separated by a plane. In this class we show that there exist differential systems having: a unique limit cycle, a unique…
We generalise the result of Berger and Shaw the trace formula for Hardy Hilbert space to a larger class of rotation invariant Hilbert function spaces on the unit disk. We also demonstrate many meaningful examples of these Hilbert spaces by…
This paper is concerned with the analysis of a class of impacting systems of relevance in applications: cam-follower systems. We show that these systems, which can be modelled as discontinuously forced impact oscillators, can exhibit…
We study the coded systems introduced by Blanchard and Hansel. We give several constructions which allow one to represent a coded system as a strongly unambiguous one.
It is shown that if an infinite synchronized system has a flip, then it has infinitely many non-conjugate flips, and that the result cannot be extended to the class of coded systems.
We define class-closing factor codes from shifts of finite type and show that they are continuing if their images are of finite type. We establish several relations between class-closing factor codes, continuing factor codes and…
This paper presents an analysis on nonstandard generalized Hopf bifurcation in a class of switched systems where the lost of stability of linearized systems is not due to the crossing of their complex conjugate eigenvalues but relevant to…
We investigate what happens when we try to work with continuing block codes (i.e. left or right continuing factor maps) between shift spaces that may not be shifts of finite type. For example, we demonstrate that continuing block codes on…
Given a code from a shift space to an irreducible sofic shift, any two of the following three conditions -- open, constant-to-one, (right or left) closing -- imply the third. If the range is not sofic, then the same result holds when…