Revues internationales avec comité de lecture
- New types of automata to solve fixed point problems doi:10.1016/S0304-3975(99)00335-7
TCS (Theoretical Computer Science), vol 259/1-2, pp.183-197, 2001
(Rapport interne 98.10 en format postscript gzipé / internal report in .gz.ps format)
- A solution to the problem of (A,B)-invariance for series doi:10.1016/S0304-3975(02)00234-7
TCS (Theoretical Computer Science), vol 293/1, pp.115-139, 2003
(Rapport interne 99.08 en format postscript gzipé (version corrigée) / internal report in .gz.ps format)
- Some representations for series on idempotent semirings pdf
Kybernetika, vol 39/2, pp.177-192, 2003
version journal de / journal version of Workshop on Max-Plus Algebras
- Deciding unambiguity and sequentiality from a finitely ambiguous automaton doi:10.1016/j.tcs.2004.02.049
avec / with Sylvain Lombardy, Jean Mairesse & Christophe Prieur
TCS (Theoretical Computer Science), vol 327/3, pp.349-373, 2004
(Rapport interne 2003-018 en format postscript gzipé / internal report in .gz.ps format)
version journal de / journal version of DLT 2003
- On the supports of recognizable series over a field and a single letter alphabet doi:10.1016/j.ipl.2011.09.010
avec / with Guillaume Chapuy
IPL (Information Processing Letters), vol 111, pp. 1096-1098, 2011
- On the finiteness problem for automaton (semi)groups doi:10.1142/S021819671250052X arXiv:1105.4725
avec / with Ali Akhavi, Sylvain Lombardy, Jean Mairesse & Matthieu Picantin
IJAC (International Journal of Algebra and Computation) vol 22, No 6, 26 p., 2012
- Automaton semigroups: the two-state case doi:10.1007/s00224-014-9594-0
ToCS (Theory of Computing Systems), special issue on STACS'13, vol 58, No 4, pp.664-680, 2014
- Orbit automata as a new tool to attack the order problem in automaton groups doi:10.1016/j.jalgebra.2015.07.003 arXiv:1411.0158
avec / with Matthieu Picantin & Dmytro Savchuk
Journal of Algebra, vol 445, pp.433-457, 2016
- On level-transitivity and exponential growth doi:10.1007/s00233-016-9824-7 hal-01323857
Semigroup Forum, vol 95, No 3, pp.441-447, 2016
- A connected 3-state reversible Mealy automaton
cannot generate an infinite Burnside group doi:10.1142/S0129054118400087
avec / with Matthieu Picantin & Dmytro Savchuk
IJFCS (International Journal of Foundations of Computer
Science), special issue on DLT'15, vol 29, No 297, 2018
- On bireversible Mealy automata and the
Burnside problemdoi:10.1016/j.tcs.2017.10.005
avec / with Thibault Godin, version longue de / extended
version of MFCS'16
Theoretical Computer Science, vol 707, pp.24-35, 2018.
Conférences internationales avec comité de lecture
- Deciding the sequentiality of a finitely ambiguous Max-Plus automaton doi:10.1007/3-540-45007-6_30
avec / with Sylvain Lombardy, Jean Mairesse & Christophe Prieur
DLT 2003, LNCS 2710, pp.373-385, 2003.
- Implementing computations in automaton (semi)groups doi:10.1007/978-3-642-31606-7_21
avec / with Jean Mairesse & Matthieu Picantin
CIAA 2012, LNCS 7381, pp.240-252, 2012. (N. Moreira and R.Reis Eds.)
- The finiteness of a group generated by a 2-letter
invertible-reversible Mealy automaton is decidable doi:10.4230/LIPIcs.STACS.2013.502
STACS 2013, LIPICS 20, pp.502-513, 2013. (N. Portier and Th. Wilke Eds.)
selected in ToCS' special issue of STACS 2013
-
A characterization of those automata that structurally generate finite groups doi:10.1007/978-3-642-54423-1_16 arXiv:1310.7137
avec / with Matthieu Picantin
LATIN 2014, LNCS 8392, pp.180-189.
-
On torsion-free semigroups generated by invertible reversible Mealy automata doi:10.1007/978-3-319-15579-1_25 arXiv:1410.4488
avec / with Thibault Godin & Matthieu Picantin
LATA 2015, LNCS 8977, pp. 328-339.
-
A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group doi:10.1007/978-3-319-21500-6_25 arXiv:1409.6142
avec / with Matthieu Picantin & Dmytro Savchuk
DLT 2015, LNCS 9168, pp. 313-325.
- Connected reversible Mealy automata of prime
size cannot generate infinite Burnside
groups doi:10.4230/LIPIcs.MFCS.2016.44 arXiv:1604.03270
avec / with Thibault Godin
MFCS 2016
- To infinity and beyond hal-01575586 doi:10.4230/LIPIcs.ICALP.2018.131
ICALP 2018
- A new hierarchy for automaton
semigroups arXiv:1803.09991
avec / with Laurent Bartholdi, Thibault Godin &
Matthieu Picantin
CIAA 2018
Chapitre de livre
- Automaton (Semi)groups: Wang Tilings and
Schreier Tries
avec / with Matthieu Picantin
dans / in Sequences, Groups, and Number Theory
Springer, 2018.
Conférencière invitée
- Automaton semigroups: the two-state case
Groups acting on rooted trees and around,
IHP trimester on random walks and asymptotic geometry of groups, 2014
- New Trends in Automata Groups and Semigroups,
2015 International meeting AMS-EMS-SPM, special session
- Journées Annuelles du GDR Automata, Logic, Games & Algebra Informatique Mathématique, 2015.
- Journées Annuelles Systèmes Dynamiques, Automates et Algorithmes du GDR Informatique Mathématique, 2015.
- Automatha 2015, Jewels of Automata: from Mathematics to Applications, 2015.
- WATA 2016.
- Journées
annuelles du gdr IM, Montpellier, 2017.
- Bridges
between Automatic Sequences, Algebra and Number Theory,
Thematic Semester: Algebra and Words in Combinatorics, Montréal, 2017.
- AMS
Special session on “Combinatorial/Geometric/Probabilistic Methods in
Group Theory”, Denton, 2017.
Colloques internationaux
- Some applications of multi-automata to fixed point problems
FICS 2000 (FIxed Points in Computer Science):
-
Several types of representations for series on idempotent
semirings
- or how to go beyond recognizability keeping representability
Satellite Workshop on Max-Plus Algebras, 27-29 August, 2001, Praha, (S. Gaubert and J. J. Loiseau Eds.), IFAC SSSC 01, Elsevier Science.
Soumis ou en cours de rédaction
- Boundary action of automaton groups without singular points and Wang tilings arXiv:1604.07736
avec / with Daniele D'Angeli, Thibault Godin, Matthieu Picantin & Emanuele Rodaro
Divers
- Manuscrit d'habilitation: Autour de divers problèmes de décision sur les automates, soutenue le 17 janvier 2014
pdf
-
Thèse de Doctorat / Ph.D. Thesis: Langages, séries et contrôle de trajectoires
postscript.gz, pdf, résumé / abstract (en Anglais / in English)
-
mémoire de DEA :
Systèmes à événements discrets, synthèse d'un superviseur.