✦ LIBER ✦

Dynamical systems characterized by automata

✍ Scribed by A. B. Engel

Publisher: Springer Vienna
Year: 1979
Tongue: English
Weight: 255 KB
Volume: 23
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02252610

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A structure theory of automata character

A structure theory of automata characterized by groups

✍ Yoshifumi Masunaga; Shoichi Noguchi; Juro Oizumi 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 289 KB

The structure of a strongly connected permutation automaton, a quasiperfect automaton, and a perfect automaton are discussed algebraically using group theory. A characterization theorem for the three classes of automata, a condition for direct product decomposability of a strongly connected permutat

Finite automata-models for the investiga

Finite automata-models for the investigation of dynamical systems

✍ Christian Schittenkopf; Gustavo Deco; Wilfried Brauer 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 429 KB

We describe a method to measure the complexity of a dynamical system. By complexity we mean the intrinsic information processing abilities which we believe to be visible only on an infinitesimal scale. The complexity measure is based on concepts from information theory and from the theory of formal

Cyclic linear differential automata: a s

Cyclic linear differential automata: a simple class of hybrid dynamical systems

✍ Andrey V. Savkin; Alexey S. Matveev 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 201 KB

We introduce a special class of hybrid dynamical systems: cyclic linear di!erential automata (CLDA). We show that any CLDA can be reduced to a linear discrete-time system with periodic coe$cients. Any CLDA has no equilibrium points. Therefore, the simplest attractor in such system is a periodic traj

Investigating topological chaos by eleme

Investigating topological chaos by elementary cellular automata dynamics

✍ Gianpiero Cattaneo; Michele Finelli; Luciano Margara 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 171 KB

We apply the two di erent deÿnitions of chaos given by Devaney and by Knudsen for general discrete time dynamical systems (DTDS) to the case of elementary cellular automata, i.e., 1-dimensional binary cellular automata with radius 1. A DTDS is chaotic according to the Devaney's deÿnition of chaos i

Representations of (M, R)-systems by cat

Representations of (M, R)-systems by categories of automata

✍ M.W. Warner 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 349 KB

Arbib in a paper entitled 'Categories of (M, R)-Systems' represents both simple (M, R)systems and those with varying genome as subcategories of the category of automata. An alternative characterisation of general (M, R)-systems as automata is proposed and two theorems on (M,R)-automata are proved. T

Dynamical systems produced by recurrent

Dynamical systems produced by recurrent neural networks

✍ Masahiro Kimura; Ryohei Nakano 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 237 KB 👁 2 views

Concerning the learning problems of recurrent neural networks (RNNs), this paper deals with the problem of approximating a dynamical system (DS) by an RNN as one extension of the problem of approximating trajectories by an RNN. In particular, we systematically investigate how an RNN can produce a DS