| Francesca Fiorenzi
|
Copyright notice
Articles in Journals
-
T. Ceccherini-Silberstein, M. Coornaert, F. Fiorenzi, P. E. Schupp and N. W. M. Touikan,
Multipass automata and group word problems
Theor. Comput. Sci. 600 (2015), 19-33 .
© Elsevier
-
T. Ceccherini-Silberstein, M. Coornaert, F. Fiorenzi and Z. Sunić,
Cellular automata between sofic tree shifts,
Theoret. Comput. Sci. 506 (2013), 79-101
© Elsevier
- T. Ceccherini-Silberstein, M. Coornaert, F. Fiorenzi and P. E. Schupp,
Groups, graphs, languages, automata, games and second-order monadic logic, European J.
Combin. 33 (2012) no. 7, 1330-1368 © Elsevier
- F. Fiorenzi, P. Ochem, P. Ossona de Mendez and X. Zhu,
Thue choosability of trees, Discrete Appl. Math 159
(2011) no. 17, 2045-2049 © Elsevier
- F. Fiorenzi, P. Ochem and E. Vaslet,
Bounds for the generalized repetition threshold, Theoret. Comput. Sci. 412
(2011), 2955–2963 © Elsevier
- F. Fiorenzi,
Periodic configurations of subshifts on groups, Internat. J. Algebra Comput.
19 (2009) no. 3, 315–335
© World Scientific Publishing Company
- M.-P. Béal, F. Fiorenzi and D. Perrin, The syntactic graph of a sofic shift is
invariant under shift equivalence, Internat. J. Algebra
Comput. 16 (2006) no. 3, 443-460 © World Scientific Publishing Company
-
M.-P. Béal, F. Fiorenzi and D. Perrin, A
hierarchy of shift equivalent sofic shifts,
Theoret. Comput. Sci. 345
(2005) no. 2-3, 190-205 © Elsevier
-
M.-P. Béal, F. Fiorenzi and F. Mignosi,
Minimal forbidden patterns of
multi-dimensional shifts, Internat. J. Algebra Comput.
15 (2005) no. 1, 73-93 © World Scientific Publishing
Company
-
F. Fiorenzi, Semi-strongly irreducible
shifts, Adv. in Appl. Math. 32 (2004) no. 3, 421-438
© Elsevier
-
A. Dartois, F. Fiorenzi and P. Francini,
Sandpile group on the graph Dn of the dihedral group, European J.
Combin. 24 (2003) no. 7, 815-824 © Elsevier
-
F. Fiorenzi,
Cellular automata and strongly irreducible
shifts of finite type, Theoret. Comput. Sci. 299
(2003) no. 1-3, 477-493 © Elsevier
-
F. Fiorenzi,
The Garden of Eden theorem for sofic
shifts, Pure Mathematics and Applications 11 (2000)
no. 3, 471-484
Articles in Conference and Workshop Proceedings
-
G. Fici and F. Fiorenzi,
Topological properties of cellular automata on trees,
AUTOMATA 2012, Elec. Proc. in Theoret. Comput. Sci. 90 (2012), 255-266
-
T. Ceccherini-Silberstein, M. Coornaert, F. Fiorenzi and Z. Sunić,
Cellular automata on regular rooted trees,
CIAA 2012, Lect. Notes in Comput. Sci. 7381 (2012), 101-112
© Springer-Verlag
-
F. Fiorenzi and P. Ochem,
More on generalized repetition thresholds,
WORDS 2009. Salerno, September 14-18 2009
-
M.-P. Béal, F. Fiorenzi and D. Perrin, A
hierarchy of irreducible sofic shifts, MFCS'04, Lect. Notes in
Comput. Sci. 3153 (2004), 611-622 © Springer-Verlag
-
M.-P. Béal, F. Fiorenzi and D. Perrin, The syntactic graph of a sofic shift,
STACS'04, Lect. Notes in Comput. Sci. 2996 (2004), 282-293
© Springer-Verlag
-
T. Ceccherini-Silberstein, F. Fiorenzi and F. Scarabotti, The Garden of Eden theorem for cellular
automata and for symbolic dynamical systems, Random walks
and geometry (Vienna 2001), 73-108, de Gruyter, Berlin, 2004
PhD thesis
Cellular automata and finitely generated
groups University of Rome "La Sapienza", 2000
Technical reports
-
F. Fiorenzi,
Semi-strong irreducibility for shifts
and Moore-Myhill property, Quaderno of the Department of
Mathematics of the University of Rome "La Sapienza", no. 40 (2000)
-
F. Fiorenzi,
Albero binario libero, Quaderno of
the Department of Mathematics of the University of Parma, no. 153 (1996)
-
F. Fiorenzi,
Gli Alberi sradicati binari come concetto
essenziale per la descrizione dei modelli di EAB, Quaderno of
the Department of Mathematics of the University of Parma, no. 152(1996)
|