most citedCellular automata between sofic tree shifts

12 citations · 41 across the 6 of their papers we have counts for

collaborators

6 papers

math.GR2014

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…

cs.FL2014★ 8 cited

Periodic configurations of subshifts on groups

Francesca Fiorenzi

We study the density of periodic configurations for shift spaces defined on (the Cayley graph of) a finitely generated group. We prove that in the case of a full shift on a residua…

cs.FL2012★ 12 cited

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…

cs.FL2012★ 6 cited

Topological properties of cellular automata on trees

Gabriele Fici, Francesca Fiorenzi

We prove that there do not exist positively expansive cellular automata defined on the full k-ary tree shift (for k>=2). Moreover, we investigate some topological properties of the…

cs.FL2012★ 6 cited

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…

math.GR2012★ 9 cited

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…