Related papers: On the Induction Operation for Shift Subspaces and…
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…
This paper presents a general and systematic discussion of various symbolic representations of iterated maps through subshifts. We give a unified model for all continuous maps on a metric space, by representing a map through a general…
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 treat here the interrelation between formal languages and those dynamical systems that can be described by cellular automata (CA). There is a well-known injective map which identifies any CA-invariant subshift with a central formal…
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…
This chapter presents some of the links between automata theory and symbolic dynamics. The emphasis is on two particular points. The first one is the interplay between some particular classes of automata, such as local automata and results…
The structure of subspaces of a Hilbert space that are invariant under unitary representations of a discrete group is related to a notion of Hilbert modules endowed with inner products taking values in spaces of unbounded operators. A…
Systems obtained by quotienting a subshift of finite type (SFT) by another SFT are called finitely presented in the literature. Analogously, if a sofic shift is quotiented by a sofic equivalence relation, we call the resulting system…
The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…
This article presents a general description of dynamical systems using the language of enriched functors and enriched natural transformations. This framework is essential to establish the equivalence of three descriptions of dynamics -- a…
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…
A finite collection $P$ of finite sets tiles the integers iff the integers can be expressed as a disjoint union of translates of members of $P$. We associate with such a tiling a doubly infinite sequence with entries from $P$. The set of…
In this paper we develop a co-induction operation which transforms an invariant random subgroup of a group into an invariant random subgroup of a larger group. We use this operation to construct new continuum size families of non-atomic,…
A sofic approximation to a countable group is a sequence of partial actions on finite sets that asymptotically approximates the action of the group on itself by left-translations. A group is sofic if it admits a sofic approximation. Sofic…
In this paper we provide sufficient conditions in order to show that the set image of a continuous and shift-commuting map defined on a shift space over an arbitrary discrete alphabet is also a shift space; additionally, if such a map is…
We investigate subshifts with a general algebraic structure and cellular automata on them, with an emphasis on (order-theoretic) lattices. Our main results concern the characterization of Boolean algebraic subshifts, conditions for…
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…
To study discrete dynamical systems of different types --- deterministic, statistical and quantum --- we develop various approaches. We introduce the concept of a system of discrete relations on an abstract simplicial complex and develop…
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…
In this article, we compare the dynamics of the shift map and its induced counterpart on the hyperspace of the shift space. We show that many of the properties of induced shift map can be easily demonstrated by appropriate sequences of…