Cellular automata and strongly irreducible shifts of finite type F Fiorenzi Theoretical computer science 299 (1-3), 477-493, 2003 | 45 | 2003 |

Sandpile group on the graph Dn of the dihedral group A Dartois, F Fiorenzi, P Francini European Journal of Combinatorics 24 (7), 815-824, 2003 | 41 | 2003 |

Thue choosability of trees F Fiorenzi, P Ochem, PO De Mendez, X Zhu Discrete Applied Mathematics 159 (17), 2045-2049, 2011 | 33 | 2011 |

The Garden of Eden theorem for sofic shifts F Fiorenzi Pure Math. Appl. 11 (3), 471-484, 2000 | 25 | 2000 |

The Garden of Eden theorem for cellular automata and for symbolic dynamical systems T Ceccherini-Silberstein, F Fiorenzi, F Scarabotti na, 2004 | 23 | 2004 |

Minimal forbidden patterns of multi-dimensional shifts MP Béal, F Fiorenzi, F Mignosi International journal of algebra and computation 15 (01), 73-93, 2005 | 20 | 2005 |

Cellular automata between sofic tree shifts T Ceccherini-Silberstein, M Coornaert, F Fiorenzi, Z Šunić Theoretical Computer Science 506, 79-101, 2013 | 15 | 2013 |

Periodic configurations of subshifts on groups F Fiorenzi International Journal of Algebra and Computation 19 (03), 315-335, 2009 | 15 | 2009 |

A hierarchy of shift equivalent sofic shifts MP Béal, F Fiorenzi, D Perrin Theoretical computer science 345 (2-3), 190-205, 2005 | 14 | 2005 |

Multipass automata and group word problems T Ceccherini-Silberstein, M Coornaert, F Fiorenzi, PE Schupp, ... Theoretical Computer Science 600, 19-33, 2015 | 13 | 2015 |

Cellular automata and finitely generated groups F Fiorenzi Thèse de doctorat, University of Rome" La Sapienza, 2000 | 12 | 2000 |

The syntactic graph of a sofic shift is invariant under shift equivalence MP Béal, F Fiorenzi, D Perrin International Journal of Algebra and Computation 16 (03), 443-460, 2006 | 11 | 2006 |

Groups, graphs, languages, automata, games and second-order monadic logic T Ceccherini-Silberstein, M Coornaert, F Fiorenzi, PE Schupp European Journal of Combinatorics 33 (7), 1330-1368, 2012 | 9 | 2012 |

Topological properties of cellular automata on trees G Fici, F Fiorenzi arXiv preprint arXiv:1208.2766, 2012 | 9 | 2012 |

Bounds for the generalized repetition threshold F Fiorenzi, P Ochem, E Vaslet Theoretical computer science 412 (27), 2955-2963, 2011 | 8 | 2011 |

Semi-strongly irreducible shifts F Fiorenzi Advances in Applied Mathematics 32 (3), 421-438, 2004 | 8 | 2004 |

Cellular automata on regular rooted trees T Ceccherini-Silberstein, M Coornaert, F Fiorenzi, Z Šunić Implementation and Application of Automata: 17th International Conference …, 2012 | 7 | 2012 |

The syntactic graph of a sofic shift MP Béal, F Fiorenzi, D Perrin Annual Symposium on Theoretical Aspects of Computer Science, 282-293, 2004 | 6 | 2004 |

A hierarchy of irreducible sofic shifts MP Béal, F Fiorenzi, D Perrin Mathematical Foundations of Computer Science 2004: 29th International …, 2004 | 4 | 2004 |

More on generalized repetition thresholds F Fiorenzi, P Ochem Proc. 7th Int. Conf. on Words. Salerno, Italy 16, 2009 | 1 | 2009 |