zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Sequential dynamical systems over words. (English) Zbl 1134.37312
Summary: 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.

37B10Symbolic dynamics
68Q45Formal languages and automata
Full Text: DOI
[1] Barrett, C.; Reidys, C.: Elements of a theory of computer simulation. I: sequential CA over random graphs. Appl. math. Comput. 98, No. 2-3, 241-259 (1999) · Zbl 0927.68114
[2] Barrett, C.; Mortveit, H.; Reidys, C.: Elements of a theory of computer simulation. II: sequential dynamical systems. Appl. math. Comput. 107, No. 2-3, 121-136 (2000) · Zbl 1049.68149
[3] Barrett, C.; Mortveit, H.; Reidys, C.: Elements of a theory of computer simulation. III: equivalence of sds. Appl. math. Comput. 122, No. 3, 325-340 (2001) · Zbl 1050.68161
[4] Barrett, C.; Mortveit, H.; Reidys, C.: Elements of a theory of computer simulation. IV: sequential dynamical systems: fixed points, invertibility and equivalence. Appl. math. Comput. 134, No. 1, 153-171 (2003) · Zbl 1028.37010
[5] Laubenbacher, R.; Pareigis, B.: Equivalence relations on finite dynamical systems. Adv. appl. Math. 26, 237-251 (2001) · Zbl 0986.37028
[6] Reidys, C.: Acyclic orientations of random graphs. Adv. appl. Math. 21, No. 2, 181-192 (1998) · Zbl 0916.05062
[7] Laubenbacher, R.; Pareigis, B.: Decomposition and simulation of sequential dynamical systems. Adv. appl. Math. 30, 655-678 (2003) · Zbl 1027.37049
[8] Lidl, R.; Niederreiter, H.: Finite fields. (1997) · Zbl 1139.11053
[9] Diekert, V.: Combinatorics on traces. Lecture notes in computer science 454 (1990) · Zbl 0717.68002
[10] Reidys, C.: On acyclic orientations and sequential dynamical systems. Adv. appl. Math. 27, 790-804 (2001) · Zbl 1017.68144