相关论文: Dynamical Systems and Factors of Finite Automata
We argue that simple dynamical systems are factors of finite automata, regarded as dynamical systems on discontinuum. We show that any homeomorphism of the real interval is of this class. An orientation preserving homeomorphism of the…
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…
We study discrete dynamical systems through the topological concepts of limit set, which consists of all points that can be reached arbitrarily late, and asymptotic set, which consists of all adhering values of orbits. In particular, we…
Standard dynamical systems theory is centred around the coordinate-invariant asymptotic-time properties of autonomous systems. We identify three limitations of this approach. Firstly, we discuss how the traditional approach cannot take into…
Congruences for stochastic automata are defined, the correspondin factor automata are constructed and investigated for automata ove analytic spaces. We study the behavior under finite and infinite streams. Congruences consist of multiple…
The motion of a spinning football brings forth the possible existence of a whole class of finite dynamical systems where there may be non-denumerably infinite number of fixed points. They defy the very traditional meaning of the fixed point…
The dynamics of a linear dynamical system over a finite field can be described by using the elementary divisors of the corresponding matrix. It is natural to extend the investigation to a general finite commutative ring. In a previous…
We establish a connection between finite fields and finite dynamical systems. We show how this connection can be used to shed light on some problems in finite dynamical systems and in particular, in linear systems.
Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A well know result, due to Kari, says that all nontrivial…
We introduce a new analytical method, which allows to find out chaotic dynamics in non-smooth dynamical systems. A simple mechanical system consisting of a mass and a dry friction element is considered as an example. The corresponding…
Dynamical Systems theory generally deals with fixed point iterations of continuous functions. Computation by Turing machine although is a fixed point iteration but is not continuous. This specific category of fixed point iterations can only…
The problem of linking the structure of a finite linear dynamical system with its dynamics is well understood when the phase space is a vector space over a finite field. The cycle structure of such a system can be described by the…
Cellular automata, CA for short are continuous maps defined on the set of configurations over a finite alphabet A that commutes with the shift. They are characterized by the existence of local function which determine by local behavior the…
We study structural restrictions on biautomata such as, e.g., acyclicity, permutation-freeness, strongly permutation-freeness, and orderability, to mention a few. We compare the obtained language families with those induced by deterministic…
We are interested in topological and ergodic properties of one dimensional cellular automata. We show that an ergodic cellular automaton cannot have irrational eigenvalues. We show that any cellular automaton with an equicontinuous factor…
A mechanical system is presented exhibiting a non-deterministic singularity, that is, a point in an otherwise deterministic system where forward time trajectories become non-unique. A Coulomb friction force applies linear and angular forces…
A new class of critical points, termed as perpetual points, where acceleration becomes zero but the velocity remains non-zero, are observed in dynamical systems. The velocity at these points is either maximum or minimum or of inflection…
We prove that any finite system of interacted automata can not leave some finite arear of Calley graph of periodic group. If group has non-periodic element, then its Calley graph can be explored by some finite automata with 3 pebbles. If…
We study dynamical systems with the property that all the nontrivial factors have infinite topological entropy (or, positive mean dimension). We establish an ``if and only if'' condition for this property among a typical class of dynamical…
We study automatic sequences and automatic systems generated by general constant length (nonprimitive) substitutions. While an automatic system is typically uncountable, the set of automatic sequences is countable, implying that most…