Equivalence Relations on Finite Dynamical Systems
暂无分享,去创建一个
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.
[1] Christian M. Reidys,et al. Elements of a theory of simulation II: sequential dynamical systems , 2000, Appl. Math. Comput..
[2] Christian M. Reidys,et al. Simulations in Decision Making for Socio-technical Systems , 1998 .
[3] Christian M. Reidys,et al. Elements of a theory of computer simulation I: Sequential CA over random graphs , 1999, Appl. Math. Comput..
[4] Christopher L. Barrett,et al. Elements of a Theory of Simulation , 1995, ECAL.