33 citations · 162 across the 31 of their papers we have counts for
5 papers · 1 filter
Cellular automata between sofic tree shifts
Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi +1
We study the sofic tree shifts of , where is a regular rooted tree of finite rank. In particular, we give their characterization in terms of unrestricted Rabin autom…
An analogue of Fekete's lemma for subadditive functions on cancellative amenable semigroups
Tullio Ceccherini-Silberstein, Fabrice Krieger, Michel Coornaert
We prove an analogue of Fekete's lemma for subadditive right-subinvariant functions defined on the finite subsets of a cancellative left-amenable semigroup. This extends results pr…
Cellular automata on regular rooted trees
Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi +1
We study cellular automata on regular rooted trees. This includes the characterization of sofic tree shifts in terms of unrestricted Rabin automata and the decidability of the surj…
Surjunctivity and reversibility of cellular automata over concrete categories
Tullio Ceccherini-Silberstein, Michel Coornaert
Following ideas developed by Misha Gromov, we investigate surjunctivity and reversibility properties of cellular automata defined over certain concrete categories.
Groups, Graphs, Languages, Automata, Games and Second-order Monadic Logic
Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi +1
In this paper we survey some surprising connections between group theory, the theory of automata and formal languages, the theory of ends, infinite games of perfect information, an…