| 2026 | DLT | Thue-Morse Series and k-ary Partitions. | Mehdi Golafshan, Michel Rigo |
| 2023 | ISIT | Gapped Binomial Complexities in Sequences. | Michel Rigo, Manon Stipulanti, Markus A. Whiteland |
| 2022 | DLT | Binomial Complexities and Parikh-Collinear Morphisms. | Michel Rigo, Manon Stipulanti, Markus A. Whiteland |
| 2022 | MFCS | On Extended Boundary Sequences of Morphic and Sturmian Words. | Michel Rigo, Manon Stipulanti, Markus A. Whiteland |
| 2020 | DLT | Reconstructing Words from Right-Bounded-Block Words. | Pamela Fleischmann, Marie Lejeune, Florin Manea, Dirk Nowotka, Michel Rigo |
| 2019 | DLT | Computing the k-binomial Complexity of the Thue-Morse Word. | Marie Lejeune, Julien Leroy, Michel Rigo |
| 2017 | ICALP | An Efficient Algorithm to Decide Periodicity of b-Recognisable Sets Using MSDF Convention. | Bernard Boigelot, Isabelle Mainz, Victor Marsault, Michel Rigo |
| 2013 | DLT | On the Number of Abelian Bordered Words. | Narad Rampersad, Michel Rigo, Pavel Salimov |
| 2011 | LATA | Syntactic Complexity of Ultimately Periodic Sets of Integers. | Michel Rigo, lise Vandomme |
| 2010 | DLT | On the Periodicity of Morphic Words. | Vesa Halava, Tero Harju, Tomi Krki, Michel Rigo |
| 2010 | DLT | Numeration Systems: A Link between Number Theory and Formal Language Theory. | Michel Rigo |
| 2009 | MFCS | On the Recognizability of Self-generating Sets. | Tomi Krki, Anne Lacroix, Michel Rigo |
| 2008 | MFCS | A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems. | Emilie Charlier, Michel Rigo |
| 2005 | MFCS | Abstract Numeration Systems and Tilings. | Valrie Berth, Michel Rigo |
| 2002 | MFCS | Characterizing Simpler Recognizable Sets of Integers. | Michel Rigo |