Generalization of automatic sequences for numeration systems on a regular language. - Michel Rigo (Theor. Comput. Sci., 2000)

Towards a characterization of the star-free sets of integers - Michel Rigo (CoRR, 2001)

Numeration Systems on a Regular Language. - Pierre B. A. Lecomte; Michel Rigo (Theory Comput. Syst., 2001)

Numeration systems on a regular language: arithmetic operations, recognizability and formal power series. - Michel Rigo (Theor. Comput. Sci., 2001)

Construction of regular languages and recognizability of polynomials. - Michel Rigo (Discret. Math., 2002)

More on Generalized Automatic Sequences. - Michel Rigo; Arnaud Maes (J. Autom. Lang. Comb., 2002)

On the Representation of Real Numbers Using Regular Languages. - Pierre B. A. Lecomte; Michel Rigo (Theory Comput. Syst., 2002)

The commutative closure of a binary slip-language is context-free: a new proof. - Michel Rigo (Discret. Appl. Math., 2003)

Decidability questions related to abstract numeration systems. - Juha Honkala; Michel Rigo (Discret. Math., 2004)

Real numbers having ultimately periodic representations in abstract numeration systems. - Pierre B. A. Lecomte; Michel Rigo (Inf. Comput., 2004)

Characterizing Simpler Recognizable Sets of Integers. - Michel Rigo (Stud Logica, 2004)

Abstract Numeration Systems and Tilings. - Valérie Berthé; Michel Rigo (MFCS, 2005)

A Note on Syndeticity, Recognizable Sets and Cobham's Theorem. - Michel Rigo; Laurent Waxweiler (Bull. EATCS, 2006)

Abstract numeration systems on bounded languages and multiplication by a constant - Emilie Charlier; Michel Rigo; Wolfgang Steiner (CoRR, 2007)

Foreword to the Special Issue Dedicated to the 10th "Journées Montoises d'Informatique Théorique". - Michel Rigo; Véronique Bruyère (Discret. Math. Theor. Comput. Sci., 2007)

Odometers on Regular Languages. - Valérie Berthé; Michel Rigo (Theory Comput. Syst., 2007)

Distribution of Additive Functions with Respect to Numeration Systems on Regular Languages. - Peter J. Grabner; Michel Rigo (Theory Comput. Syst., 2007)

About frequencies of letters in generalized automatic sequences. - Samuel Nicolay; Michel Rigo (Theor. Comput. Sci., 2007)

A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems. - Emilie Charlier; Michel Rigo (MFCS, 2008)

Syntactical and automatic properties of sets of polynomials over finite fields. - Michel Rigo (Finite Fields Their Appl., 2008)

A morphic approach to combinatorial games: the Tribonacci case. - Éric Duchêne; Michel Rigo (RAIRO Theor. Informatics Appl., 2008)

Preface to the special issue dedicated to combinatorics, automata and number theory. - Valérie Berthé; Pierre B. A. Lecomte; Michel Rigo (Theor. Comput. Sci., 2008)

On the Recognizability of Self-generating Sets. - Tomi Kärki; Anne Lacroix; Michel Rigo (MFCS, 2009)

Syndeticity and independent substitutions. - Fabien Durand; Michel Rigo (Adv. Appl. Math., 2009)

A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems - Jason P. Bell; Emilie Charlier; Aviezri S. Fraenkel; Michel Rigo (CoRR, 2009)

Representing Real Numbers in a Generalized Numeration Systems - Emilie Charlier; Marion Le Gonidec; Michel Rigo (CoRR, 2009)

A Decision Problem for Ultimately Periodic Sets in Nonstandard Numeration Systems. - Jason P. Bell; Emilie Charlier; Aviezri S. Fraenkel; Michel Rigo (Int. J. Algebra Comput., 2009)

On the Periodicity of Morphic Words. - Vesa Halava; Tero Harju; Tomi Kärki; Michel Rigo (Developments in Language Theory, 2010)

Numeration Systems: A Link between Number Theory and Formal Language Theory. - Michel Rigo (Developments in Language Theory, 2010)

State Complexity of Testing Divisibility - Emilie Charlier; Narad Rampersad; Michel Rigo; Laurent Waxweiler (DCFS, 2010)

Multidimensional generalized automatic sequences and shape-symmetric morphic words. - Emilie Charlier; Tomi Kärki; Michel Rigo (Discret. Math., 2010)

Foreword. - Véronique Bruyère; Michel Rigo (RAIRO Theor. Informatics Appl., 2010)

Extensions and restrictions of Wythoff's game preserving its p positions. - Éric Duchêne; Aviezri S. Fraenkel; Richard J. Nowakowski; Michel Rigo (J. Comb. Theory A, 2010)

Invariant games. - Éric Duchêne; Michel Rigo (Theor. Comput. Sci., 2010)

Systèmes de numération abstraits et combinatoire des mots (habilitation à diriger des recherches). - Michel Rigo (2010)

Syntactic Complexity of Ultimately Periodic Sets of Integers. - Michel Rigo; Élise Vandomme (LATA, 2011)

Some answer to Nivat's conjecture: A characterization of periodicity with respect to block complexity - Fabien Durand; Michel Rigo (CoRR, 2011)

Logical Characterization of Recognizable Sets of polynomials over a Finite Field. - Michel Rigo; Laurent Waxweiler (Int. J. Found. Comput. Sci., 2011)

The Minimal Automaton Recognizing mN in a Linear Numeration System. - Émilie Charlier; Narad Rampersad; Michel Rigo; Laurent Waxweiler (Integers, 2011)

Representing real numbers in a generalized numeration system. - Emilie Charlier; Marion Le Gonidec; Michel Rigo (J. Comput. Syst. Sci., 2011)

Syntactic Complexity of Ultimately Periodic Sets of Integers and Application to a Decision Procedure. - Anne Lacroix; Narad Rampersad; Michel Rigo; Élise Vandomme (Fundam. Informaticae, 2012)

On the Number of Abelian Bordered Words. - Narad Rampersad; Michel Rigo; Pavel Salimov (Developments in Language Theory, 2013)

Invariant games and non-homogeneous Beatty sequences. - Julien Cassaigne; Éric Duchêne; Michel Rigo (CoRR, 2013)

Towards an analogue of Cobham's theorem for beta-numerations. - Emilie Charlier; Julien Leroy 002; Michel Rigo (CoRR, 2013)

Multidimensional extension of the Morse-Hedlund theorem. - Fabien Durand; Michel Rigo (Eur. J. Comb., 2013)

On the number of Abelian Bordered Words (with an Example of Automatic Theorem-Proving). - Daniel Goc; Narad Rampersad; Michel Rigo; Pavel Salimov (Int. J. Found. Comput. Sci., 2014)

Special issue in the honor of the 14th "Journées Montoises d'Informatique Théorique" - Foreword. - Raphaël M. Jungers; Véronique Bruyère; Romain Hollanders; Michel Rigo (RAIRO Theor. Informatics Appl., 2014)

A note on abelian returns in rotation words. - Narad Rampersad; Michel Rigo; Pavel Salimov (Theor. Comput. Sci., 2014)

A New Approach to the 2-Regularity of the ℓ-Abelian Complexity of 2-Automatic Sequences. - Aline Parreau; Michel Rigo; Eric Rowland; Élise Vandomme (Electron. J. Comb., 2015)

Asymptotic properties of free monoid morphisms. - Emilie Charlier; Julien Leroy 002; Michel Rigo (CoRR, 2015)

Avoiding 2-binomial squares and cubes. - Michaël Rao; Michel Rigo; Pavel Salimov (Theor. Comput. Sci., 2015)

Another generalization of abelian equivalence: Binomial complexity of infinite words. - Michel Rigo; Pavel Salimov (Theor. Comput. Sci., 2015)

Generalized Pascal triangle for binomial coefficients of words. - Julien Leroy 002; Michel Rigo; Manon Stipulanti (Adv. Appl. Math., 2016)

Relations on words. - Michel Rigo (CoRR, 2016)

Nonhomogeneous Beatty Sequences Leading to Invariant Games. - Julien Cassaigne; Éric Duchêne; Michel Rigo (SIAM J. Discret. Math., 2016)

An Efficient Algorithm to Decide Periodicity of b-Recognisable Sets Using MSDF Convention. - Bernard Boigelot; Isabelle Mainz; Victor Marsault; Michel Rigo (ICALP, 2017)

Behavior of Digital Sequences Through Exotic Numeration Systems. - Julien Leroy 002; Michel Rigo; Manon Stipulanti (Electron. J. Comb., 2017)

Counting Subwords Occurrences in Base-b Expansions. - Julien Leroy 002; Michel Rigo; Manon Stipulanti (CoRR, 2017)

Counting the number of non-zero coefficients in rows of generalized Pascal triangles. - Julien Leroy 002; Michel Rigo; Manon Stipulanti (Discret. Math., 2017)

Deciding game invariance. - Éric Duchêne; Aline Parreau; Michel Rigo (Inf. Comput., 2017)

Foreword to the special issue dedicated to the sixteenth "Journées Montoises d'Informatique Théorique". - Émilie Charlier; Julien Leroy 002; Michel Rigo (RAIRO Theor. Informatics Appl., 2017)

Counting Subword Occurrences in Base-b Expansions. - Julien Leroy 002; Michel Rigo; Manon Stipulanti (Integers, 2018)

Templates for the k-Binomial Complexity of the Tribonacci Word. - Marie Lejeune; Michel Rigo; Matthieu Rosenfeld (WORDS, 2019)

Computing the k-binomial Complexity of the Thue-Morse Word. - Marie Lejeune; Julien Leroy 002; Michel Rigo (DLT, 2019)

Automatic sequences based on Parry or Bertrand numeration systems. - Adeline Massuir; Jarkko Peltomäki; Michel Rigo (Adv. Appl. Math., 2019)

Preface. - Émilie Charlier; Julien Leroy 002; Michel Rigo (Int. J. Found. Comput. Sci., 2019)

The carry propagation of the successor function. - Valérie Berthé; Christiane Frougny; Michel Rigo; Jacques Sakarovitch (Adv. Appl. Math., 2020)

Templates for the k-binomial complexity of the Tribonacci word. - Marie Lejeune; Michel Rigo; Matthieu Rosenfeld (Adv. Appl. Math., 2020)

Taking-and-merging games as rewrite games. - Éric Duchêne; Victor Marsault; Aline Parreau; Michel Rigo (Discret. Math. Theor. Comput. Sci., 2020)

The binomial equivalence classes of finite words. - Marie Lejeune; Michel Rigo; Matthieu Rosenfeld (Int. J. Algebra Comput., 2020)

Computing the k-binomial complexity of the Thue-Morse word. - Marie Lejeune; Julien Leroy 002; Michel Rigo (J. Comb. Theory A, 2020)

On Cobham's theorem. - Fabien Durand; Michel Rigo (Handbook of Automata Theory (II.), 2021)

Reconstructing Words from Right-Bounded-Block Words. - Pamela Fleischmann; Marie Lejeune; Florin Manea; Dirk Nowotka; Michel Rigo (Int. J. Found. Comput. Sci., 2021)

Binomial Complexities and Parikh-Collinear Morphisms. - Michel Rigo; Manon Stipulanti; Markus A. Whiteland (DLT, 2022)

On digital sequences associated with Pascal's triangle. - Pierre Mathonet; Michel Rigo; Manon Stipulanti; Naïm Zénaïdi (CoRR, 2022)

Revisiting regular sequences in light of rational base numeration systems. - Michel Rigo; Manon Stipulanti (Discret. Math., 2022)

Automatic sequences: from rational bases to trees. - Michel Rigo; Manon Stipulanti (Discret. Math. Theor. Comput. Sci., 2022)

Ultimate periodicity problem for linear numeration systems. - Émilie Charlier; Adeline Massuir; Michel Rigo; Eric S. Rowland (Int. J. Algebra Comput., 2022)

Automaticity and Parikh-Collinear Morphisms. - Michel Rigo; Manon Stipulanti; Markus A. Whiteland (WORDS, 2023)

Gapped Binomial Complexities in Sequences. - Michel Rigo; Manon Stipulanti; Markus A. Whiteland (ISIT, 2023)

On Extended Boundary Sequences of Morphic and Sturmian Words. - Michel Rigo; Manon Stipulanti; Markus A. Whiteland (Electron. J. Comb., 2024)

Introducing q-deformed binomial coefficients of words. - Antoine Renard; Michel Rigo; Markus A. Whiteland (CoRR, 2024)

Computing the k-binomial complexity of generalized Thue-Morse words. - Mehdi Golafshan; Michel Rigo; Markus A. Whiteland (CoRR, 2024)

Characterizations of families of morphisms and words via binomial complexities. - Michel Rigo; Manon Stipulanti; Markus A. Whiteland (Eur. J. Comb., 2024)

Automatic Abelian Complexities of Parikh-Collinear Fixed Points. - Michel Rigo; Manon Stipulanti; Markus A. Whiteland (Theory Comput. Syst., 2024)

Binomial Coefficients of Multidimensional Arrays. - Mehdi Golafshan; Michel Rigo (WORDS, 2025)

q-Parikh matrices and q-deformed binomial coefficients of words. - Antoine Renard; Michel Rigo; Markus A. Whiteland (Discret. Math., 2025)

Computing Expansions in Infinitely Many Cantor Real Bases via a Single Transducer. - Émilie Charlier; Pierre Popoli; Michel Rigo (CoRR, 2025)