Large semigroups of cellular automata.

DOI10.1017/S0143385711000551MaRDI QIDQ4911055zbMATH OpenOpenAlexFDO

Authors Yair Hartman

Publication date 13 March 2013

Published in Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1007.0583

zbMATH Keywords

cellular automatasemigroups of transformationslinear semigroups

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Dynamical aspects of cellular automata (37B15) Semigroups in automata theory, linguistics, etc. (20M35)

Abstract: 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". The first property is ID and the other property is maximal commutativity (MC). A semigroup has the ID property if the only infinite invariant closed set (with respect to the semigroup action) is the entire space. 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 of integers mod n). It will be shown that the 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 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 such a way that preserves the ID and the MC properties.

Recommendations

• Ranks of finite semigroups of one-dimensional cellular automata
• Dynamical characteristics of linear cellular automata
• Decision problems for cellular automata and their semigroups
• Groups and Monoids of Cellular Automata
• The Myhill property for cellular automata on amenable semigroups

Cites work

• Cellular automata and groups
• Dynamical properties of expansive one-sided cellular automata
• Invariant measures for higher-rank hyperbolic abelian actions
• Linear cellular automata over \(Z_ m\)
• Non literal transducers and some problems of normality
• On the automorphism groups of multidimensional shifts of finite type
• The Garden of Eden theorem for linear cellular automata
• ×2 and ×3 invariant measures and entropy

Cited in

(8)

• On the trace subshifts of fractional multiplication automata
• On Finite Monoids of Cellular Automata
• On the Interplay of Direct Topological Factorizations and Cellular Automata Dynamics on Beta-Shifts
• Cellular automata and finite groups
• Large Aperiodic Semigroups
• Computational Analysis of One-Dimensional Cellular Automata
• Ranks of finite semigroups of one-dimensional cellular automata
• A characterization of cellular automata generated by idempotents on the full shift

This page was built for publication: Large semigroups of cellular automata.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4911055)