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 t
β¦ LIBER β¦
Equivalence systems with finitely many relations
β Scribed by Gerhard Behrendt
- Publisher
- Springer Vienna
- Year
- 1987
- Tongue
- English
- Weight
- 316 KB
- Volume
- 103
- Category
- Article
- ISSN
- 0026-9255
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Equivalence Relations on Finite Dynamica
β
Reinhard Laubenbacher; Bodo Pareigis
π
Article
π
2001
π
Elsevier Science
π
English
β 121 KB
Global integrals for plane systems with
β
L. Mazzi; M. Sabatini
π
Article
π
1992
π
Elsevier Science
π
English
β 409 KB
Algebras with finitely many orbits
β
Jan OkniΕski; Lex E. Renner
π
Article
π
2003
π
Elsevier Science
π
English
β 180 KB
Any algebra of finite representation type has a finite number of two-sided ideals. But there are stronger finiteness conditions that should be considered here. We consider finite-dimensional Kalgebras that have only a finite number of left (respectively, principal left) ideals, up to conjugacy. We t
Rings with finitely many subrings
β
Howard E. Bell
π
Article
π
1969
π
Springer
π
English
β 336 KB
On decomposing systems of polynomial equ
β
H. Michael MΓΆller
π
Article
π
1993
π
Springer
π
English
β 786 KB
Finite-Range Repulsive Systems of Finite
β
Xinfu Chen; Reinhard Illner
π
Article
π
2004
π
Springer
π
English
β 237 KB