33 citations · 162 across the 31 of their papers we have counts for
3 papers · 1 filter
On Residually Finite Semigroups of Cellullar Automata
Tullio Ceccherini-Silberstein, Michel Coornaert
We prove that if is a monoid and a finite set with more than one element, then the residual finiteness of is equivalent to that of the monoid consisting of all cellular…
On surjunctive monoids
Tullio Ceccherini-Silberstein, Michel Coornaert
A monoid is called surjunctive if every injective cellular automata with finite alphabet over is surjective. We show that all finite monoids, all finitely generated commuta…
Multipass automata and group word problems
Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi +2
We introduce the notion of multipass automata as a generalization of pushdown automata and study the classes of languages accepted by such machines. The class of languages accepted…