On residually finite semigroups of cellullar automata
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 .
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2015-06-01
|
| Series: | International Journal of Group Theory |
| Subjects: | |
| Online Access: | http://www.theoryofgroups.ir/pdf_9371_d9d2ea9f8888eea71e9b2c32637ec037.html |