|
|
on residually finite semigroups of cellullar automata
|
|
|
|
|
نویسنده
|
- - ,- -
|
منبع
|
international journal of group theory - 2015 - دوره : 4 - شماره : 2 - صفحه:9 -15
|
چکیده
|
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
|
آدرس
|
dipartimento di ingegneria, università, dipartimento di ingegneria, università del sannio, ایران, irma, irma, France
|
پست الکترونیکی
|
michel.coornaert@math.unistra.fr
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|