Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4637428 | Applied Mathematics and Computation | 2006 | 11 Pages |
Abstract
This paper is motivated by the theory of sequential dynamical systems (SDS), developed as a basis for a mathematical theory of computer simulation. A sequential dynamical system is a collection of symmetric Boolean local update functions, with the update order determined by a permutation of the Boolean variables. In this paper, the notion of SDS is generalized to allow arbitrary functions over a general finite field, with the update schedule given by an arbitrary word on the variables. The paper contains generalizations of some of the known results about SDS with permutation update schedules. In particular, an upper bound on the number of different SDS over words of a given length is proved and open problems are discussed.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Luis David Garcia, Abdul Salam Jarrah, Reinhard Laubenbacher,