𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Equivalence Relations on Finite Dynamical Systems

✍ Scribed by Reinhard Laubenbacher; Bodo Pareigis


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
121 KB
Volume
26
Category
Article
ISSN
0196-8858

No coin nor oath required. For personal study only.

✦ Synopsis


This paper is motivated by the theory of sequential dynamical systems, developed as a basis for a theory of computer simulation. We study finite dynamical systems on binary strings, that is, iterates of functions from 0 1 n to itself. We introduce several equivalence relations on systems and study the resulting equivalence classes. The case of two-dimensional systems is studied in detail.


πŸ“œ SIMILAR VOLUMES


On the unidimensional fuzzy equivalence
✍ D. Boixader πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 165 KB

The dimension of a fuzzy equivalence relation is the minimum number of fuzzy sets needed to generate it. A general theorem is proved that characterizes unidimensional fuzzy equivalence relations. The multidimensional case is also studied under some Ε½ . restrictive conditions regular fuzzy equivalenc

On Dynamical Stability in General Dynami
✍ Desheng Li πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 160 KB

This paper is concerned with dynamical stability of general dynamical systems. We discuss invariance properties of some limit sets, investigate connections between various notions and definitions related to stability and attraction properties, and establish existence results for invariant uniform at

Adjacency and Parity Relations of Words
✍ William Y.C. Chen; James D. Louck; Jun Wang πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 222 KB

Words on two letters, or their equivalent representation by : sequences, label the branches of the inverse graph of the n th iterate of the parabolic map p `(x) = `x(2&x) of the real line. The abstract properties of words control the evolution of this graph in the content parameter `. In particular,

On Ξ£11 equivalence relations over the na
✍ Ekaterina B. Fokina; Sy-David Friedman πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 155 KB

## Abstract We study the structure of Ξ£^1^~1~ equivalence relations on hyperarithmetical subsets of Ο‰ under reducibilities given by hyperarithmetical or computable functions, called h‐reducibility and FF‐reducibility, respectively. We show that the structure is rich even when one fixes the number o