Related papers: Symbolic dynamics
A class of highly symmetric Markov-Dyck shifts is introduced. Topological entropies and zeta functions are determined.
Computational simulations are a popular method for testing hypotheses about the emergence of communication. This kind of research is performed in a variety of traditions including language evolution, developmental psychology, cognitive…
We introduce a new extension in symbolic dynamics on two sets of alphabets, called the zip shift space. In finite case, it represents a finite-to-1 local homeomorphism called zip shift map. Such extension, offers a conjugacy between some…
Iterations of odd piecewise continuous maps with two discontinuities, i.e., symmetric discontinuous bimodal maps, are studied. Symbolic dynamics is introduced. The tools of kneading theory are used to study the homology of the discrete…
This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups…
The spin coherent state path integral describing the dynamics of a spin-1/2-system in a magnetic field of arbitrary time-dependence is considered. Defining the path integral as the limit of a Wiener regularized expression, the semiclassical…
We start with comparisons of hierarchies in Biology and relate it to Quan- tum Field Theories. Thereby we discover many similarities and translate them into rich mathematical correspondences. The basic connection goes via scale…
In this paper we provide a closed mathematical formulation of our previous results in the field of symbolic dynamics of unimodal maps. This being the case, we discuss the classical theory of applied symbolic dynamics for unimodal maps and…
In this work we establish that finite directed graphs give rise to semiflows on the power set of their nodes. We analyze the topological dynamics for semiflows on finite directed graphs by characterizing Morse decompositions, recurrence…
The theory of slow manifolds is an important tool in the study of deterministic dynamical systems, giving a practical method by which to reduce the number of relevant degrees of freedom in a model, thereby often resulting in a considerable…
This paper explores the connection between dynamical system properties and statistical physics of ensembles of such systems. Simple models are used to give novel phase transitions; particularly for finite N particle systems with many…
We consider the category of partially observable dynamical systems, to which the entropy theory of dynamical systems extends functorially. This leads us to introduce quotient-topological entropy. We discuss the structure that emerges. We…
Cellular automata are fully-discrete, spatially-extended dynamical systems that evolve by simultaneously applying a local update function. Despite their simplicity, the induced global dynamic produces a stunning array of richly-structured,…
Several coupled maps models are sketched and reviewed in this short communication. First, a discrete logistic type model that was proposed for the symbiotic interaction of two species. Second, a model of many of these symbiotic species…
This paper is a survey of extensions to finite automata theory to model real-time systems as well as systems exhibiting mixed discrete-continuous behavior. Real-time systems maintain a continuous and timely interaction with the environment,…
For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…
This work describes the way that topological mixing and chaos in continua, as induced by discrete dynamical systems, can or can't be understood through topological conjugacy with symbolic dynamical systems. For example, there is no symbolic…
We conceive finite automata as dynamical systems on discontinuum and investigate their factors. Factors of finite automata include many well-known simple dynamical systems, e.g. hyperbolic systems and systems with finite attractors. In the…
Motivated by Ziegler's computability-theoretic characterisation of finite absolute presentability between groups, we prove an analogous theorem in symbolic dynamics. We introduce the notion of one subshift being finitely determined over…
We extend the theory of Cellular Automata to arbitrary, time-varying graphs. In other words we formalize, and prove theorems about, the intuitive idea of a labelled graph which evolves in time - but under the natural constraint that…