On residually finite semigroups of cellullar automata

نویسندگان
Ceccherini-Silberstein, Tullio ID 1
Coornaert, Michel ID 2

1 Dipartimento di Ingegneria, Università del Sannio

2 IRMA

doi
10.22108/ijgt.2015.9371
چکیده

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

کلیدواژه‌ها
cellular automaton, monoid, semigroup, residual finiteness, Hopficity