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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.