On residually finite semigroups of cellullar automata

DOI10.22108/IJGT.2015.9371MaRDI QIDQ5853458zbMATH OpenOpenAlexFDO

Authors Michel Coornaert, Tullio Ceccherini-Silberstein

Publication date 10 March 2021

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

zbMATH Keywords

semigroupcellular automatonmonoidresidual finitenesshopficity

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80) Semigroups in automata theory, linguistics, etc. (20M35)

Abstract: We prove that if $M$ is a monoid and $A$ a finite set with more than one element, then the residual finiteness of $M$ is equivalent to that of the monoid consisting of all cellular automata over $M$ with alphabet $A$.

Recommendations

• On residual finiteness of monoids, their Schützenberger groups and associated actions.
• scientific article; zbMATH DE number 5343230
• Residual finiteness of a class of semigroups presented by a single relation
• scientific article; zbMATH DE number 1429562
• On Finite Monoids of Cellular Automata

Cites work

• scientific article; zbMATH DE number 3039752 (Why is no real title available?)
• Endomorphisms and automorphisms of the shift dynamical system
• On Infinite Soluble Groups (III)
• On a Theorem of Malcev
• On nilpotency and residual finiteness in semigroups
• On surjunctive monoids
• Residual finiteness of finitely generated commutative semigroups
• Residually Finite Semigroups of Endomorphisms
• The Automorphism Group of a Shift of Finite Type

Cited in

(4)

• Generating infinite monoids of cellular automata
• scientific article; zbMATH DE number 7559411 (Why is no real title available?)
• On surjunctive monoids
• scientific article; zbMATH DE number 5343230 (Why is no real title available?)

This page was built for publication: On residually finite semigroups of cellullar automata

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