Regular Article: Equivalence Relations on Finite Dynamical Systems

Authors:
Reinhard Laubenbacher;Bodo Pareigis
Affiliations:
Department of Mathematical Sciences, New Mexico State University, Las Cruces, New Mexico, 88003f1reinhard@nmsu.eduf1;Mathematisches Institut, Universität München, Theresienstr. 39, D-80333, München, Germanyf2pareigis@rz.mathematik.uni-muenchen.def2
Venue:
Advances in Applied Mathematics
Year:
2001

Citing 0
Cited 6

A computer algebra approach to biological systems

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Update schedules of sequential dynamical systems

Discrete Applied Mathematics
Complexity of reachability problems for finite discrete dynamical systems

Journal of Computer and System Sciences
Predecessor existence problems for finite discrete dynamical systems

Theoretical Computer Science
Update schedules of sequential dynamical systems

Discrete Applied Mathematics
Reconfigurable hardware implementation of a multivariate polynomial interpolation algorithm

International Journal of Reconfigurable Computing - Special issue on selected papers from ReconFig 2009 International conference on reconfigurable computing and FPGAs (ReconFig 2009)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.