Hostname: page-component-7b7567c8c-kwt9d Total loading time: 0 Render date: 2026-11-14T01:48:03.655Z Has data issue: false hasContentIssue false

Large semigroups of cellular automata

Published online by Cambridge University Press:  20 October 2011

YAIR HARTMAN*
Affiliation:
Faculty of Mathematics and Computer Science, Weizmann Institute of Science, POB 26, Rehovot, 76100, Israel (email: yair.hartman@weizmann.ac.il)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this article, we consider semigroups of transformations of cellular automata which act on a fixed shift space. In particular, we are interested in two properties of these semigroups which relate to ‘largeness’: first, a semigroup has the ID (infinite is dense) property if the only infinite invariant closed set (with respect to the semigroup action) is the entire space; the second property is maximal commutativity (MC). We shall consider two examples of semigroups: one is spanned by cellular automata transformations that represent multiplications by integers on the one-dimensional torus, and the other one consists of all the cellular automata transformations which are linear (when the symbols set is the ring ℤ/sℤ). It will be shown that these two properties of these semigroups depend on the number of symbols s. The multiplication semigroup is ID and MC if and only if s is not a power of a prime. The linear semigroup over the mentioned ring is always MC but is ID if and only if s is prime. When the symbol set is endowed with a finite field structure (when possible), the linear semigroup is both ID and MC. In addition, we associate with each semigroup which acts on a one-sided shift space a semigroup acting on a two-sided shift space, and vice versa, in a way that preserves the ID and the MC properties.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 2011