Michel Rigo

ORCID

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 53

Top Venues

Publications

Antoine Renard, Michel Rigo, Markus A. Whiteland
q-Parikh Matrices and q-deformed binomial coefficients of words. CoRR (2024)
Michel Rigo, Manon Stipulanti, Markus A. Whiteland
On Extended Boundary Sequences of Morphic and Sturmian Words. Electron. J. Comb. 31 (1) (2024)
Michel Rigo, Manon Stipulanti, Markus A. Whiteland
Automatic Abelian Complexities of Parikh-Collinear Fixed Points. CoRR (2024)
Antoine Renard, Michel Rigo, Markus A. Whiteland
Introducing q-deformed binomial coefficients of words. CoRR (2024)
Michel Rigo, Manon Stipulanti, Markus A. Whiteland
Characterizations of families of morphisms and words via binomial complexities. Eur. J. Comb. 118 (2024)
Michel Rigo, Manon Stipulanti, Markus A. Whiteland
Gapped Binomial Complexities in Sequences. ISIT (2023)
Michel Rigo, Manon Stipulanti, Markus A. Whiteland
Automaticity and Parikh-Collinear Morphisms. WORDS (2023)
Michel Rigo, Manon Stipulanti, Markus A. Whiteland
On Extended Boundary Sequences of Morphic and Sturmian Words. MFCS (2022)
Émilie Charlier, Adeline Massuir, Michel Rigo, Eric S. Rowland
Ultimate periodicity problem for linear numeration systems. Int. J. Algebra Comput. 32 (3) (2022)
Michel Rigo, Manon Stipulanti, Markus A. Whiteland
Binomial Complexities and Parikh-Collinear Morphisms. CoRR (2022)
Michel Rigo, Manon Stipulanti, Markus A. Whiteland
Binomial Complexities and Parikh-Collinear Morphisms. DLT (2022)
Michel Rigo, Manon Stipulanti
Revisiting regular sequences in light of rational base numeration systems. Discret. Math. 345 (3) (2022)
Pierre Mathonet, Michel Rigo, Manon Stipulanti, Naïm Zénaïdi
On digital sequences associated with Pascal's triangle. CoRR (2022)
Michel Rigo, Manon Stipulanti
Automatic sequences: from rational bases to trees. Discret. Math. Theor. Comput. Sci. 24 (1) (2022)
Michel Rigo, Manon Stipulanti, Markus A. Whiteland
On extended boundary sequences of morphic and Sturmian words. CoRR (2022)
Michel Rigo, Manon Stipulanti
Automatic sequences: from rational bases to trees. CoRR (2021)
Michel Rigo, Manon Stipulanti
Revisiting regular sequences in light of rational base numeration systems. CoRR (2021)
Pamela Fleischmann, Marie Lejeune, Florin Manea, Dirk Nowotka, Michel Rigo
Reconstructing Words from Right-Bounded-Block Words. Int. J. Found. Comput. Sci. 32 (6) (2021)
Valérie Berthé, Christiane Frougny, Michel Rigo, Jacques Sakarovitch
The carry propagation of the successor function. Adv. Appl. Math. 120 (2020)
Marie Lejeune, Julien Leroy, Michel Rigo
-binomial complexity of the Thue-Morse word. J. Comb. Theory, Ser. A 176 (2020)
Pamela Fleischmann, Marie Lejeune, Florin Manea, Dirk Nowotka, Michel Rigo
Reconstructing Words from Right-Bounded-Block Words. CoRR (2020)
Pamela Fleischmann, Marie Lejeune, Florin Manea, Dirk Nowotka, Michel Rigo
Reconstructing Words from Right-Bounded-Block Words. DLT (2020)
Emilie Charlier, Adeline Massuir, Michel Rigo, Eric Rowland
Ultimate periodicity problem for linear numeration systems. CoRR (2020)
Marie Lejeune, Michel Rigo, Matthieu Rosenfeld
The binomial equivalence classes of finite words. Int. J. Algebra Comput. 30 (07) (2020)
Marie Lejeune, Michel Rigo, Matthieu Rosenfeld
On the binomial equivalence classes of finite words. CoRR (2020)
Marie Lejeune, Michel Rigo, Matthieu Rosenfeld
-binomial complexity of the Tribonacci word. Adv. Appl. Math. 112 (2020)
Éric Duchêne, Victor Marsault, Aline Parreau, Michel Rigo
Taking-and-merging games as rewrite games. Discret. Math. Theor. Comput. Sci. 22 (4) (2020)
Éric Duchêne, Victor Marsault, Aline Parreau, Michel Rigo
Taking-and-merging games as rewrite games. CoRR (2019)
Émilie Charlier, Julien Leroy, Michel Rigo
Preface. Int. J. Found. Comput. Sci. 30 (1) (2019)
Valérie Berthé, Christiane Frougny, Michel Rigo, Jacques Sakarovitch
The carry propagation of the successor function. CoRR (2019)
Marie Lejeune, Julien Leroy, Michel Rigo
Computing the k-binomial Complexity of the Thue-Morse Word. DLT (2019)
Adeline Massuir, Jarkko Peltomäki, Michel Rigo
Automatic sequences based on Parry or Bertrand numeration systems. Adv. Appl. Math. 108 (2019)
Marie Lejeune, Michel Rigo, Matthieu Rosenfeld
Templates for the k-Binomial Complexity of the Tribonacci Word. WORDS (2019)
Marie Lejeune, Julien Leroy, Michel Rigo
Computing the k-binomial complexity of the Thue-Morse word. CoRR (2018)
Julien Leroy, Michel Rigo, Manon Stipulanti
Counting Subword Occurrences in Base-b Expansions. Integers (2018)
Adeline Massuir, Jarkko Peltomäki, Michel Rigo
Automatic sequences based on Parry or Bertrand numeration systems. CoRR (2018)
Éric Duchêne, Aline Parreau, Michel Rigo
Deciding game invariance. Inf. Comput. 253 (2017)
Julien Leroy, Michel Rigo, Manon Stipulanti
Counting the number of non-zero coefficients in rows of generalized Pascal triangles. Discret. Math. 340 (5) (2017)
Julien Leroy, Michel Rigo, Manon Stipulanti
Behavior of Digital Sequences Through Exotic Numeration Systems. Electron. J. Comb. 24 (1) (2017)
Julien Leroy, Michel Rigo, Manon Stipulanti
Generalized Pascal triangle for binomial coefficients of words. CoRR (2017)
Émilie Charlier, Julien Leroy, Michel Rigo
Foreword to the special issue dedicated to the sixteenth "Journées Montoises d'Informatique Théorique". RAIRO Theor. Informatics Appl. 51 (4) (2017)
Julien Leroy, Michel Rigo, Manon Stipulanti
Counting Subwords Occurrences in Base-b Expansions. CoRR (2017)
Julien Leroy, Michel Rigo, Manon Stipulanti
Behavior of digital sequences through exotic numeration systems. CoRR (2017)
Julien Leroy, Michel Rigo, Manon Stipulanti
Counting the number of non-zero coefficients in rows of generalized Pascal triangles. CoRR (2017)
Bernard Boigelot, Isabelle Mainz, Victor Marsault, Michel Rigo
An Efficient Algorithm to Decide Periodicity of b-Recognisable Sets Using MSDF Convention. ICALP (2017)
Bernard Boigelot, Isabelle Mainz, Victor Marsault, Michel Rigo
An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention. CoRR (2017)
Julien Leroy, Michel Rigo, Manon Stipulanti
Generalized Pascal triangle for binomial coefficients of words. Adv. Appl. Math. 80 (2016)
Michel Rigo
Relations on words. CoRR (2016)
Julien Cassaigne, Éric Duchêne, Michel Rigo
Nonhomogeneous Beatty Sequences Leading to Invariant Games. SIAM J. Discret. Math. 30 (3) (2016)
Michaël Rao, Michel Rigo, Pavel Salimov
Avoiding 2-binomial squares and cubes. Theor. Comput. Sci. 572 (2015)
Michel Rigo, Pavel Salimov
Another generalization of abelian equivalence: Binomial complexity of infinite words. Theor. Comput. Sci. 601 (2015)
Emilie Charlier, Julien Leroy, Michel Rigo
Asymptotic properties of free monoid morphisms. CoRR (2015)
Aline Parreau, Michel Rigo, Eric Rowland, Élise Vandomme
A New Approach to the 2-Regularity of the ℓ-Abelian Complexity of 2-Automatic Sequences. Electron. J. Comb. 22 (1) (2015)
Narad Rampersad, Michel Rigo, Pavel Salimov
A note on abelian returns in rotation words. Theor. Comput. Sci. 528 (2014)
Daniel Goc, Narad Rampersad, Michel Rigo, Pavel Salimov
On the number of Abelian Bordered Words (with an Example of Automatic Theorem-Proving). Int. J. Found. Comput. Sci. 25 (8) (2014)
Aline Parreau, Michel Rigo, Eric Rowland, Élise Vandomme
A new approach to the $2$-regularity of the l-abelian complexity of 2-automatic sequences. CoRR (2014)
Éric Duchêne, Aline Parreau, Michel Rigo
Deciding game invariance. CoRR (2014)
Raphaël M. Jungers, Véronique Bruyère, Romain Hollanders, Michel Rigo
Special issue in the honor of the 14th "Journées Montoises d'Informatique Théorique" - Foreword. RAIRO Theor. Informatics Appl. 48 (3) (2014)
Michaël Rao, Michel Rigo, Pavel Salimov
Avoiding 2-binomial squares and cubes. CoRR (2013)
Julien Cassaigne, Éric Duchêne, Michel Rigo
Invariant games and non-homogeneous Beatty sequences. CoRR (2013)
Emilie Charlier, Julien Leroy, Michel Rigo
Towards an analogue of Cobham's theorem for beta-numerations. CoRR (2013)
Fabien Durand, Michel Rigo
Multidimensional extension of the Morse-Hedlund theorem. Eur. J. Comb. 34 (2) (2013)
Michel Rigo, Pavel Salimov
Another Generalization of Abelian Equivalence: Binomial Complexity of Infinite Words. WORDS (2013)
Narad Rampersad, Michel Rigo, Pavel Salimov
On the Number of Abelian Bordered Words. Developments in Language Theory (2013)
Michel Rigo
Numeration Systems: a Link between Number Theory and Formal Language Theory CoRR (2012)
Anne Lacroix, Narad Rampersad, Michel Rigo, Élise Vandomme
Syntactic Complexity of Ultimately Periodic Sets of Integers and Application to a Decision Procedure. Fundam. Informaticae 116 (1-4) (2012)
Émilie Charlier, Narad Rampersad, Michel Rigo, Laurent Waxweiler
The Minimal Automaton Recognizing mN in a Linear Numeration System. Integers (2011)
Michel Rigo, Élise Vandomme
Syntactic Complexity of Ultimately Periodic Sets of Integers. LATA (2011)
Fabien Durand, Michel Rigo
Some answer to Nivat's conjecture: A characterization of periodicity with respect to block complexity CoRR (2011)
Michel Rigo, Laurent Waxweiler
Logical Characterization of Recognizable Sets of polynomials over a Finite Field. Int. J. Found. Comput. Sci. 22 (7) (2011)
Emilie Charlier, Marion Le Gonidec, Michel Rigo
Representing real numbers in a generalized numeration system. J. Comput. Syst. Sci. 77 (4) (2011)
Véronique Bruyère, Michel Rigo
Foreword. RAIRO Theor. Informatics Appl. 44 (1) (2010)
Michel Rigo
Numeration Systems: A Link between Number Theory and Formal Language Theory. Developments in Language Theory (2010)
Emilie Charlier, Tomi Kärki, Michel Rigo
Multidimensional generalized automatic sequences and shape-symmetric morphic words. Discret. Math. 310 (6-7) (2010)
Vesa Halava, Tero Harju, Tomi Kärki, Michel Rigo
On the Periodicity of Morphic Words. Developments in Language Theory (2010)
Éric Duchêne, Aviezri S. Fraenkel, Richard J. Nowakowski, Michel Rigo
Extensions and restrictions of Wythoff's game preserving its p positions. J. Comb. Theory, Ser. A 117 (5) (2010)
Emilie Charlier, Narad Rampersad, Michel Rigo, Laurent Waxweiler
State Complexity of Testing Divisibility DCFS (2010)
Éric Duchêne, Michel Rigo
Invariant games. Theor. Comput. Sci. 411 (34-36) (2010)
Emilie Charlier, Tomi Kärki, Michel Rigo
Multidimensional Generalized Automatic Sequences and Shape-symmetric Morphic Words CoRR (2009)
Jason P. Bell, Emilie Charlier, Aviezri S. Fraenkel, Michel Rigo
A Decision Problem for Ultimately Periodic Sets in Nonstandard Numeration Systems. Int. J. Algebra Comput. 19 (6) (2009)
Emilie Charlier, Marion Le Gonidec, Michel Rigo
Representing Real Numbers in a Generalized Numeration Systems CoRR (2009)
Fabien Durand, Michel Rigo
Syndeticity and independent substitutions CoRR (2009)
Michel Rigo, Laurent Waxweiler
A note on syndeticity, recognizable sets and Cobham's theorem CoRR (2009)
Tomi Kärki, Anne Lacroix, Michel Rigo
On the Recognizability of Self-generating Sets. MFCS (2009)
Fabien Durand, Michel Rigo
Syndeticity and independent substitutions. Adv. Appl. Math. 42 (1) (2009)
Jason P. Bell, Emilie Charlier, Aviezri S. Fraenkel, Michel Rigo
A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems CoRR (2009)
Michel Rigo
Syntactical and automatic properties of sets of polynomials over finite fields. Finite Fields Their Appl. 14 (1) (2008)
Éric Duchêne, Michel Rigo
A morphic approach to combinatorial games: the Tribonacci case. RAIRO Theor. Informatics Appl. 42 (2) (2008)
Valérie Berthé, Pierre B. A. Lecomte, Michel Rigo
Preface to the special issue dedicated to combinatorics, automata and number theory. Theor. Comput. Sci. 391 (1-2) (2008)
Emilie Charlier, Michel Rigo
A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems. MFCS (2008)
Emilie Charlier, Michel Rigo, Wolfgang Steiner
Abstract numeration systems on bounded languages and multiplication by a constant CoRR (2007)
Peter J. Grabner, Michel Rigo
Distribution of Additive Functions with Respect to Numeration Systems on Regular Languages. Theory Comput. Syst. 40 (3) (2007)
S. Nicolay, Michel Rigo
About frequencies of letters in generalized automatic sequences. Theor. Comput. Sci. 374 (1-3) (2007)
Valérie Berthé, Michel Rigo
Odometers on Regular Languages. Theory Comput. Syst. 40 (1) (2007)
Michel Rigo, Véronique Bruyère
Foreword to the Special Issue Dedicated to the 10th "Journées Montoises d'Informatique Théorique". Discret. Math. Theor. Comput. Sci. 9 (2) (2007)
Michel Rigo, Laurent Waxweiler
A Note on Syndeticity, Recognizable Sets and Cobham's Theorem. Bull. EATCS 88 (2006)
Valérie Berthé, Michel Rigo
Abstract Numeration Systems and Tilings. MFCS (2005)
Pierre B. A. Lecomte, Michel Rigo
Real numbers having ultimately periodic representations in abstract numeration systems. Inf. Comput. 192 (1) (2004)
Juha Honkala, Michel Rigo
Decidability questions related to abstract numeration systems. Discret. Math. 285 (1-3) (2004)
Michel Rigo
Characterizing Simpler Recognizable Sets of Integers. Stud Logica 76 (3) (2004)

Michel Rigo.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Michel Rigo