On residually finite semigroups of cellullar automata

DOI10.22108/IJGT.2015.9371zbMATH Open1456.20073arXiv1410.5351OpenAlexW1926619227MaRDI QIDQ5853458FDOQ5853458

Authors: Michel Coornaert, Tullio Ceccherini-Silberstein 

Publication date: 10 March 2021

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$.

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

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

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)

Cites Work

• Endomorphisms and automorphisms of the shift dynamical system
• The Automorphism Group of a Shift of Finite Type
• Title not available (Why is that?)
• Residual finiteness of finitely generated commutative semigroups
• On a Theorem of Malcev
• On Infinite Soluble Groups (III)
• On nilpotency and residual finiteness in semigroups
• Residually Finite Semigroups of Endomorphisms
• On surjunctive monoids

Cited In (4)

• Generating infinite monoids of cellular automata
• Title not available (Why is that?)
• On surjunctive monoids
• Title not available (Why is that?)

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)