Related papers: Sofic-Dyck shifts
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…
Given a real number $ \beta > 1$, we study the associated $ (-\beta)$-shift introduced by S. Ito and T. Sadahiro. We compares some aspects of the $(-\beta)$-shift to the $\beta$-shift. When the expansion in base $ -\beta $ of $…
This paper deals with an extension of the classical concept of shift space, which corresponds to any shift-invariant closed subset of the Cartesian product of a particular finite set (alphabet) endowed with the prodiscrete topology. In such…
We will study a certain synchronizing property of subshifts called $\lambda$-synchronization. The $\lambda$-synchronizing subshifts form a large class of irreducible subshifts containing irreducible sofic shifts. We prove that the…
Relatively recently, two new classes of (discrete, countable) groups have been isolated: hyperlinear groups and sofic groups. They come from different corners of mathematics (operator algebras and symbolic dynamics, respectively), and were…
Dynamical systems at the edge of chaos, which have been considered as models of self-organization phenomena, are marked by their ability to perform nontrivial computations. To distinguish them from systems with limited computing power, we…
In this paper we introduce a new infinite set of transcendental integrals. Each of them is expressed by corresponding value of the function $|\zf|^{-2}$. Such a property is another argument about universality of the Riemann zeta-function…
Topological behavior, such as chaos, irreducibility, and mixing of a one-sided shift of finite type, is well elucidated. Meanwhile, the investigation of multidimensional shifts, for instance, textile systems is difficult and only a few…
We introduce the notion of a contractible subshift. This is a strengthening of the notion of strong irreducibility, where we require that the gluings are given by a block map. We show that a subshift is a retract of a full shift if and only…
For any context-free grammar, we build a transition diagram, that is, a finite directed graph with labeled arcs, which describes the work of the grammar. This approach is new, and it is different from previously known graph models. We…
A characterization of dynamically defined zeta functions is presented. It comprises a list of axioms, natural extension of the one which characterizes topological degree, and a uniqueness theorem. Lefschetz zeta function is the main (and…
We describe a general method to prove meromorphic continuation of dynamical zeta functions to the entire complex plane under the condition that the corresponding partition functions are given via a dynamical trace formula from a family of…
We give a sufficient condition for a symbolic topological dynamical system with action of a countable amenable group to be an extension of the full shift, a problem analogous to those studied by Ashley, Marcus, Johnson and others for…
We revisit congruence zeta functions of smooth projective varieties over finite fields in the framework of Scholze's Berkovich motives. Via this formalism and categorical traces, we construct a new zeta function, and show that it agree with…
In this work we study $S$-adic shifts generated by sequences of morphisms that are constant-length. We call a sequence of constant-length morphisms torsion-free if any prime divisor of one of the lengths is a divisor of infinitely many of…
In this paper we show that the reducibility structure of several covers of sofic shifts is a flow invariant. In addition, we prove that for an irreducible subshift of almost finite type the left Krieger cover and the past set cover are…
Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…
Shifts of finite type defined from shift equivalent matrices must be flow equivalent.
The density of a rational language can be understood as the frequency of some "pattern" in the shift space, for example a pattern like "words with an even number of a given letter." We study the density of group languages, i.e. rational…
We study the ergodic properties (recurrence, discrepancy, diffusion coefficients and ergodicity itself) of a class of $\mathbb Z$-extensions over infinite interval exchange transformations called rotated odometers. The choice of a…