Articles
-
On the dimension groups of unimodular S-adic subshifts
Monat. Math. 194, 687-717 (2021), with Valerie Berthé, Paulina Cecchi,
Fabien Durand, Julien Leroy, and samuel Petite.
-
Eventually dendric shift spaces Ergodic Th. Dynam. Syst., (2020), with Francesco Dolce.
- Aldo de Luca 1941--2018
Semigroup Forum, (2019) with Clelia De Felice and Antonio Restivo.
- Eventually Dendric Shifts CSR, Lecture Notes in Comput.
Sci. 11532: 106--118 (2019) with Francesco Dolce.
- Hall sets, Lazard sets and comma-free codes, Discrete Math. 341: 232--243 (2018)
with Christophe Reutenauer (revised version).
- Birecurrent sets
Int. J. Alg. Comput. 28: 613--652(2018), with Francesco Dolce, Antonio Restivo,
Christophe Reutenauer and Giuseppina Rindone.
- Interval exchanges, admissibility and branching Rauzy
induction, ITA, 51, 2017, with Francesco Dolce.
- Return words of linear involutions and fundamental groups, Ergodic Theory Dynam. Syst. 2017,
with Valérie Berthé, Vincent Delecroix, Francesco Dolce, Christophe Reutenauer and Giuseppina Rindone,
- Specular sets Words 2015, 210-222, with
Valérie Berthé, Clelia De Felice, Francesco Dolce, Julien Leroy,
Christophe Reutenauer and Giuseppina Rindone.
- Specular sets Theoret. Comput. Sci. 684, 2017, with
Valérie Berthé, Clelia De Felice, Francesco Dolce, Julien Leroy,
Christophe Reutenauer and Giuseppina Rindone.
- Neutral and tree sets of arbitrary characteristic ,
Theoret. Comput. Sci, 658, 2017, with Francesco Dolce.
erratum
- Codes and automata in minimal sets
Words 2015: 35-46,
corrected version
- Enumeration Formulae in neutral sets, DLT 2015, 215-227 (with Francesco Dolce).
- Corrigendum On the theorem of Fredricksen and
Maiorana about de Bruijn [Adv. in Appl.
Math. 33 (2) (2004) 413-415]
, Advances Appl. Math., 2014, with Eduardo Moreno.
- A quadratic algorithm for road coloring
Discrete Appl. Math., 2014, with Marie-Pierre Béal.
- Acyclic, connected and tree sets, Monatsh. Math. 2014, 10.1007/s00605-014-0721-4, with
Valérie Berthé, Clelia De Felice, Francesco Dolce, Julien Leroy,
Christophe Reutenauer and Giuseppina Rindone.
- The finite index basis property, J. Pure Appl. Algebra 2014, with
Valérie Berthé, Clelia DeFelice,Francesco Dolce, Julien Leroy,
Christophe Reutenauer and Giuseppina Rindone.
- Bifix codes and interval exchanges, J. Pure Appl. Algebra 2014, with
Valérie Berthé, Clelia DeFelice,Francesco Dolce, JulienLeroy,
Christophe Reutenauer and Giuseppina Rindone.
- Maximal bifix decoding, Discrete Math. 2014, with
Valérie Berthé, Clelia DeFelice,Francesco Dolce, JulienLeroy,
Christophe Reutenauer and Giuseppina Rindone.
erratum
- Completely reducible
sets, International J. Algebra and
Computation, 23 (4), 915-942 (2013)
( erratum)
-
Bifix codes and Sturmian
words Journal of Algebra, 369, 146-202, 2012,
with Jean Berstel, Clelia De Felice, Christophe Reutenauer and
Giuseppina Rindone.
-
A note on Sturmian words Theoretical Computer Science, 429, 2012,
265--272, with Antonio Restivo.
-
Recent
results on syntactic groups of prefix codes European J. Combin.,
33 (2012) 1386-1401 with Jean Berstel, Clelia De Felice, Christophe Reutenauer
and Giuseppina Rindone.
-
A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster
Automata, Int. J. Found. Comput. Sci. 22(2): 277-288 (2011),
with Marie-Pierre Béal and Mikhail V. Berlinkov.
-
Embeddings of local automata.
Illinois Journal of Mathematics, 54,
2010. pp. 155-174. with Marie-Pierre Béal and Sylvain Lombardy.
-
On the groups of
codes with empty kernel Semigroup
Forum 80, Issue 3 (2010), 351. with Jean Berstel, Clelia De Felice
and Giuseppina Rindone.
-
Codes
and noncommutative stochastic matrices
Journal of Noncommutative Geometry, 4, 2010, 531--554 (with Sylvain Lavallée
and Christophe Reutenauer).
-
Completing codes in a sofic shift, Theoret. Comput. Sci., 410,
4423-4431, 2009, with Marie-Pierre Béal.
-
Gérard Lallement (1935-2006), Semigroup Forum, 3, 379-383, 2009,
with J. Almeida.
-
Automata and semigroups recognizing infinite words,
in Logic and automata,
Amsterdam Univ. Press, 133-167, 2008, with J.-E. Pin and O. Carton.
-
Unambiguous
automata,
Math. Comput. Sci., 4, 625-638, 2008, with
Marie-Pierre Béal,
Eugen Czeizler and Jarkko Kari,
-
The origins of combinatorics on words,
European J. Combin., 28, with Jean Berstel.
996-1022, 2007
-
The
syntactic graph of a sophic shift is invariant
under shift equivalence, Int. J. Alg. Comput.,16, 2006, 443-460, with Marie-Pierre
Béal and Francesca Fiorenzi.
-
Codes, unambiguous automata and sofic
systems, Theoret. Comput. Sci., 356, 6-13, 2006, with
Marie-Pierre Béal.
-
A note
on the Burrows-Wheeler transformation, Theoret. Comput. Sci.,
332, 567-572, 2005, with Jacques
Désarménien and Maxime Crochemore.
-
Unavoidable
sets of constant length , Int. J. Alg. Comput., 14, 2004, with Jean-Marc
Champarnaud and Georges Hansel.
- Automata
and formal languages , english version of Automai e linguaggi formali,
in Storia della scienza, Istituto della Enciclopedia Italiana, IX, 2003, 197-205.
-
On the generating sequences of regular languages on $k$
symbols J. Assoc. Comput. Mach.,
50, 2003, 121-135, with Marie-Pierre Béal.
- Syntactic
Groups , Bulletin of the Belgium
Mathematical society, 10, 2003, 749-759, with Giuseppina Rindone.
- Ensembles inévitables,
Séminaire Lotharingien de Combinatoire, 2002, vol. 47. with Guoniu
Han.
- Automates
finis, Technique et Science Informatique, 2000, 19, 395-402,
- A finite-state
version of the Kraft-McMillan theorem, SIAM J. Comput., 30,1211-1230, 2000
with Frédérique Bassino and Marie-Pierre Béal
erratum
- Chains
and superchains for w-rational sets, automata and semigroups, Int.
J. Algebra Comput., 7, 1997, 673-696 with Olivier Carton.
- The
Wagner hierarchy of ω-rational sets, Int. J. Alg. Comput.,
vol. 9, no. 5, pp. 597-620, 1999. with O. Carton.
- Les débuts de la théorie des automates,
Technique et Science Informatiques, 1995, 14 (4), pp.409-433.