default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichel Rigo
Person information
- affiliation: University of Liège, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j55]Michel Rigo, Manon Stipulanti, Markus A. Whiteland:
On Extended Boundary Sequences of Morphic and Sturmian Words. Electron. J. Comb. 31(1) (2024)- [j54]Michel Rigo, Manon Stipulanti, Markus A. Whiteland:
Characterizations of families of morphisms and words via binomial complexities. Eur. J. Comb. 118: 103932 (2024) - [i41]Antoine Renard, Michel Rigo, Markus A. Whiteland:
q-Parikh Matrices and q-deformed binomial coefficients of words. CoRR abs/2402.05657 (2024) - [i40]Antoine Renard, Michel Rigo, Markus A. Whiteland:
Introducing q-deformed binomial coefficients of words. CoRR abs/2402.05838 (2024) - [i39]Michel Rigo, Manon Stipulanti, Markus A. Whiteland:
Automatic Abelian Complexities of Parikh-Collinear Fixed Points. CoRR abs/2405.18032 (2024) - 2023
- [c18]Michel Rigo
, Manon Stipulanti, Markus A. Whiteland:
Automaticity and Parikh-Collinear Morphisms. WORDS 2023: 247-260 - [c17]Michel Rigo, Manon Stipulanti, Markus A. Whiteland:
Gapped Binomial Complexities in Sequences. ISIT 2023: 1294-1299 - 2022
- [j53]Michel Rigo, Manon Stipulanti:
Revisiting regular sequences in light of rational base numeration systems. Discret. Math. 345(3): 112735 (2022) - [j52]Michel Rigo, Manon Stipulanti:
Automatic sequences: from rational bases to trees. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - [j51]Émilie Charlier, Adeline Massuir, Michel Rigo, Eric S. Rowland:
Ultimate periodicity problem for linear numeration systems. Int. J. Algebra Comput. 32(3): 561-596 (2022) - [c16]Michel Rigo, Manon Stipulanti, Markus A. Whiteland:
Binomial Complexities and Parikh-Collinear Morphisms. DLT 2022: 251-262 - [c15]Michel Rigo, Manon Stipulanti, Markus A. Whiteland:
On Extended Boundary Sequences of Morphic and Sturmian Words. MFCS 2022: 79:1-79:16 - [i38]Michel Rigo, Manon Stipulanti, Markus A. Whiteland:
Binomial Complexities and Parikh-Collinear Morphisms. CoRR abs/2201.04603 (2022) - [i37]Pierre Mathonet, Michel Rigo, Manon Stipulanti, Naïm Zénaïdi:
On digital sequences associated with Pascal's triangle. CoRR abs/2201.06636 (2022) - [i36]Michel Rigo, Manon Stipulanti, Markus A. Whiteland:
On extended boundary sequences of morphic and Sturmian words. CoRR abs/2206.15319 (2022) - 2021
- [j50]Pamela Fleischmann, Marie Lejeune, Florin Manea, Dirk Nowotka, Michel Rigo:
Reconstructing Words from Right-Bounded-Block Words. Int. J. Found. Comput. Sci. 32(6): 619-640 (2021) - [p1]Fabien Durand, Michel Rigo:
On Cobham's theorem. Handbook of Automata Theory (II.) 2021: 947-986 - [i35]Michel Rigo, Manon Stipulanti:
Automatic sequences: from rational bases to trees. CoRR abs/2102.10828 (2021) - [i34]Michel Rigo, Manon Stipulanti:
Revisiting regular sequences in light of rational base numeration systems. CoRR abs/2103.16966 (2021) - 2020
- [j49]Marie Lejeune, Michel Rigo, Matthieu Rosenfeld:
Templates for the k-binomial complexity of the Tribonacci word. Adv. Appl. Math. 112 (2020) - [j48]Valérie Berthé, Christiane Frougny, Michel Rigo, Jacques Sakarovitch:
The carry propagation of the successor function. Adv. Appl. Math. 120: 102062 (2020) - [j47]Éric Duchêne, Victor Marsault, Aline Parreau, Michel Rigo:
Taking-and-merging games as rewrite games. Discret. Math. Theor. Comput. Sci. 22(4) (2020) - [j46]Marie Lejeune, Michel Rigo, Matthieu Rosenfeld:
The binomial equivalence classes of finite words. Int. J. Algebra Comput. 30(07): 1375-1397 (2020) - [j45]Marie Lejeune, Julien Leroy, Michel Rigo:
Computing the k-binomial complexity of the Thue-Morse word. J. Comb. Theory A 176: 105284 (2020) - [c14]Pamela Fleischmann, Marie Lejeune, Florin Manea, Dirk Nowotka, Michel Rigo:
Reconstructing Words from Right-Bounded-Block Words. DLT 2020: 96-109 - [i33]Pamela Fleischmann, Marie Lejeune, Florin Manea, Dirk Nowotka, Michel Rigo:
Reconstructing Words from Right-Bounded-Block Words. CoRR abs/2001.11218 (2020) - [i32]Marie Lejeune, Michel Rigo, Matthieu Rosenfeld:
On the binomial equivalence classes of finite words. CoRR abs/2001.11732 (2020) - [i31]Emilie Charlier, Adeline Massuir, Michel Rigo, Eric Rowland:
Ultimate periodicity problem for linear numeration systems. CoRR abs/2007.08147 (2020)
2010 – 2019
- 2019
- [j44]Adeline Massuir, Jarkko Peltomäki, Michel Rigo:
Automatic sequences based on Parry or Bertrand numeration systems. Adv. Appl. Math. 108: 11-30 (2019) - [j43]Émilie Charlier, Julien Leroy, Michel Rigo:
Preface. Int. J. Found. Comput. Sci. 30(1): 1-4 (2019) - [c13]Marie Lejeune, Michel Rigo, Matthieu Rosenfeld:
Templates for the k-Binomial Complexity of the Tribonacci Word. WORDS 2019: 238-250 - [c12]Marie Lejeune, Julien Leroy, Michel Rigo:
Computing the k-binomial Complexity of the Thue-Morse Word. DLT 2019: 278-291 - [i30]Éric Duchêne, Victor Marsault, Aline Parreau, Michel Rigo:
Taking-and-merging games as rewrite games. CoRR abs/1902.07011 (2019) - [i29]Valérie Berthé, Christiane Frougny, Michel Rigo, Jacques Sakarovitch:
The carry propagation of the successor function. CoRR abs/1907.01464 (2019) - 2018
- [j42]Julien Leroy, Michel Rigo, Manon Stipulanti:
Counting Subword Occurrences in Base-b Expansions. Integers 18A: A13 (2018) - [i28]Adeline Massuir, Jarkko Peltomäki, Michel Rigo:
Automatic sequences based on Parry or Bertrand numeration systems. CoRR abs/1810.11081 (2018) - [i27]Marie Lejeune, Julien Leroy, Michel Rigo:
Computing the k-binomial complexity of the Thue-Morse word. CoRR abs/1812.07330 (2018) - 2017
- [j41]Julien Leroy, Michel Rigo, Manon Stipulanti:
Behavior of Digital Sequences Through Exotic Numeration Systems. Electron. J. Comb. 24(1): 1 (2017) - [j40]Julien Leroy, Michel Rigo, Manon Stipulanti:
Counting the number of non-zero coefficients in rows of generalized Pascal triangles. Discret. Math. 340(5): 862-881 (2017) - [j39]Éric Duchêne, Aline Parreau, Michel Rigo:
Deciding game invariance. Inf. Comput. 253: 127-142 (2017) - [j38]É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): 167 (2017) - [c11]Bernard Boigelot, Isabelle Mainz, Victor Marsault, Michel Rigo:
An Efficient Algorithm to Decide Periodicity of b-Recognisable Sets Using MSDF Convention. ICALP 2017: 118:1-118:14 - [e1]Émilie Charlier, Julien Leroy, Michel Rigo:
Developments in Language Theory - 21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings. Lecture Notes in Computer Science 10396, Springer 2017, ISBN 978-3-319-62808-0 [contents] - [i26]Bernard Boigelot, Isabelle Mainz, Victor Marsault, Michel Rigo:
An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention. CoRR abs/1702.03715 (2017) - [i25]Julien Leroy, Michel Rigo, Manon Stipulanti:
Generalized Pascal triangle for binomial coefficients of words. CoRR abs/1705.08270 (2017) - [i24]Julien Leroy, Michel Rigo, Manon Stipulanti:
Behavior of digital sequences through exotic numeration systems. CoRR abs/1705.08322 (2017) - [i23]Julien Leroy, Michel Rigo, Manon Stipulanti:
Counting the number of non-zero coefficients in rows of generalized Pascal triangles. CoRR abs/1705.08343 (2017) - [i22]Julien Leroy, Michel Rigo, Manon Stipulanti:
Counting Subwords Occurrences in Base-b Expansions. CoRR abs/1705.10065 (2017) - 2016
- [j37]Julien Leroy, Michel Rigo, Manon Stipulanti:
Generalized Pascal triangle for binomial coefficients of words. Adv. Appl. Math. 80: 24-47 (2016) - [j36]Julien Cassaigne, Éric Duchêne, Michel Rigo:
Nonhomogeneous Beatty Sequences Leading to Invariant Games. SIAM J. Discret. Math. 30(3): 1798-1829 (2016) - [i21]Michel Rigo:
Relations on words. CoRR abs/1602.03364 (2016) - 2015
- [j35]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): 1 (2015) - [j34]Michaël Rao, Michel Rigo, Pavel Salimov:
Avoiding 2-binomial squares and cubes. Theor. Comput. Sci. 572: 83-91 (2015) - [j33]Michel Rigo, Pavel Salimov:
Another generalization of abelian equivalence: Binomial complexity of infinite words. Theor. Comput. Sci. 601: 47-57 (2015) - [i20]Emilie Charlier, Julien Leroy, Michel Rigo:
Asymptotic properties of free monoid morphisms. CoRR abs/1507.00206 (2015) - 2014
- [j32]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): 1097-1110 (2014) - [j31]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): 247 (2014) - [j30]Narad Rampersad, Michel Rigo, Pavel Salimov:
A note on abelian returns in rotation words. Theor. Comput. Sci. 528: 101-107 (2014) - [i19]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 abs/1405.3532 (2014) - [i18]Éric Duchêne, Aline Parreau, Michel Rigo:
Deciding game invariance. CoRR abs/1408.5274 (2014) - 2013
- [j29]Fabien Durand, Michel Rigo:
Multidimensional extension of the Morse-Hedlund theorem. Eur. J. Comb. 34(2): 391-409 (2013) - [c10]Michel Rigo, Pavel Salimov:
Another Generalization of Abelian Equivalence: Binomial Complexity of Infinite Words. WORDS 2013: 217-228 - [c9]Narad Rampersad, Michel Rigo, Pavel Salimov:
On the Number of Abelian Bordered Words. Developments in Language Theory 2013: 420-432 - [i17]Emilie Charlier, Julien Leroy, Michel Rigo:
Towards an analogue of Cobham's theorem for beta-numerations. CoRR abs/1310.0309 (2013) - [i16]Michaël Rao, Michel Rigo, Pavel Salimov:
Avoiding 2-binomial squares and cubes. CoRR abs/1310.4743 (2013) - [i15]Julien Cassaigne, Éric Duchêne, Michel Rigo:
Invariant games and non-homogeneous Beatty sequences. CoRR abs/1312.2233 (2013) - 2012
- [j28]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): 175-187 (2012) - [i14]Michel Rigo:
Numeration Systems: a Link between Number Theory and Formal Language Theory. CoRR abs/1204.5887 (2012) - 2011
- [j27]Michel Rigo, Laurent Waxweiler:
Logical Characterization of Recognizable Sets of polynomials over a Finite Field. Int. J. Found. Comput. Sci. 22(7): 1549-1563 (2011) - [j26]Émilie Charlier, Narad Rampersad, Michel Rigo, Laurent Waxweiler:
The Minimal Automaton Recognizing mN in a Linear Numeration System. Integers 11B: A4 (2011) - [j25]Emilie Charlier, Marion Le Gonidec, Michel Rigo:
Representing real numbers in a generalized numeration system. J. Comput. Syst. Sci. 77(4): 743-759 (2011) - [c8]Michel Rigo, Élise Vandomme:
Syntactic Complexity of Ultimately Periodic Sets of Integers. LATA 2011: 477-488 - [i13]Fabien Durand, Michel Rigo:
Some answer to Nivat's conjecture: A characterization of periodicity with respect to block complexity. CoRR abs/1109.5801 (2011) - 2010
- [b1]Michel Rigo:
Systèmes de numération abstraits et combinatoire des mots (habilitation à diriger des recherches). University of Liège, Belgium, 2010 - [j24]Emilie Charlier, Tomi Kärki, Michel Rigo:
Multidimensional generalized automatic sequences and shape-symmetric morphic words. Discret. Math. 310(6-7): 1238-1252 (2010) - [j23]Véronique Bruyère, Michel Rigo:
Foreword. RAIRO Theor. Informatics Appl. 44(1): 1 (2010) - [j22]É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 A 117(5): 545-567 (2010) - [j21]Éric Duchêne, Michel Rigo:
Invariant games. Theor. Comput. Sci. 411(34-36): 3169-3180 (2010) - [c7]Michel Rigo:
Numeration Systems: A Link between Number Theory and Formal Language Theory. Developments in Language Theory 2010: 33-53 - [c6]Vesa Halava, Tero Harju, Tomi Kärki, Michel Rigo:
On the Periodicity of Morphic Words. Developments in Language Theory 2010: 209-217 - [c5]Emilie Charlier, Narad Rampersad, Michel Rigo, Laurent Waxweiler:
State Complexity of Testing Divisibility. DCFS 2010: 48-57
2000 – 2009
- 2009
- [j20]Fabien Durand, Michel Rigo:
Syndeticity and independent substitutions. Adv. Appl. Math. 42(1): 1-22 (2009) - [j19]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): 809-839 (2009) - [c4]Tomi Kärki, Anne Lacroix, Michel Rigo:
On the Recognizability of Self-generating Sets. MFCS 2009: 525-536 - [i12]Emilie Charlier, Tomi Kärki, Michel Rigo:
Multidimensional Generalized Automatic Sequences and Shape-symmetric Morphic Words. CoRR abs/0907.0615 (2009) - [i11]Jason P. Bell, Emilie Charlier, Aviezri S. Fraenkel, Michel Rigo:
A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems. CoRR abs/0907.0620 (2009) - [i10]Michel Rigo, Laurent Waxweiler:
A note on syndeticity, recognizable sets and Cobham's theorem. CoRR abs/0907.0624 (2009) - [i9]Emilie Charlier, Marion Le Gonidec, Michel Rigo:
Representing Real Numbers in a Generalized Numeration Systems. CoRR abs/0907.0942 (2009) - [i8]Fabien Durand, Michel Rigo:
Syndeticity and independent substitutions. CoRR abs/0907.4583 (2009) - 2008
- [j18]Michel Rigo:
Syntactical and automatic properties of sets of polynomials over finite fields. Finite Fields Their Appl. 14(1): 258-276 (2008) - [j17]Éric Duchêne, Michel Rigo:
A morphic approach to combinatorial games: the Tribonacci case. RAIRO Theor. Informatics Appl. 42(2): 375-393 (2008) - [j16]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): 1-2 (2008) - [c3]Emilie Charlier, Michel Rigo:
A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems. MFCS 2008: 241-252 - 2007
- [j15]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) - [j14]Valérie Berthé, Michel Rigo:
Odometers on Regular Languages. Theory Comput. Syst. 40(1): 1-31 (2007) - [j13]Peter J. Grabner, Michel Rigo:
Distribution of Additive Functions with Respect to Numeration Systems on Regular Languages. Theory Comput. Syst. 40(3): 205-223 (2007) - [j12]Samuel Nicolay, Michel Rigo:
About frequencies of letters in generalized automatic sequences. Theor. Comput. Sci. 374(1-3): 25-40 (2007) - [i7]Emilie Charlier, Michel Rigo, Wolfgang Steiner:
Abstract numeration systems on bounded languages and multiplication by a constant. CoRR abs/0706.0431 (2007) - 2006
- [j11]Michel Rigo, Laurent Waxweiler:
A Note on Syndeticity, Recognizable Sets and Cobham's Theorem. Bull. EATCS 88: 169-173 (2006) - 2005
- [c2]Valérie Berthé, Michel Rigo:
Abstract Numeration Systems and Tilings. MFCS 2005: 131-143 - 2004
- [j10]Juha Honkala, Michel Rigo:
Decidability questions related to abstract numeration systems. Discret. Math. 285(1-3): 329-333 (2004) - [j9]Pierre B. A. Lecomte, Michel Rigo:
Real numbers having ultimately periodic representations in abstract numeration systems. Inf. Comput. 192(1): 57-83 (2004) - [j8]Michel Rigo:
Characterizing Simpler Recognizable Sets of Integers. Stud Logica 76(3): 407-426 (2004) - 2003
- [j7]Michel Rigo:
The commutative closure of a binary slip-language is context-free: a new proof. Discret. Appl. Math. 131(3): 665-672 (2003) - 2002
- [j6]Michel Rigo:
Construction of regular languages and recognizability of polynomials. Discret. Math. 254(1-3): 485-496 (2002) - [j5]Michel Rigo, Arnaud Maes:
More on Generalized Automatic Sequences. J. Autom. Lang. Comb. 7(3): 351-376 (2002) - [j4]Pierre B. A. Lecomte, Michel Rigo:
On the Representation of Real Numbers Using Regular Languages. Theory Comput. Syst. 35(1): 13-38 (2002) - [c1]Michel Rigo:
Characterizing Simpler Recognizable Sets of Integers. MFCS 2002: 615-624 - [i6]Pierre B. A. Lecomte, Michel Rigo:
Real numbers having ultimately periodic representations in abstract numeration systems. CoRR cs.CC/0212018 (2002) - 2001
- [j3]Pierre B. A. Lecomte, Michel Rigo:
Numeration Systems on a Regular Language. Theory Comput. Syst. 34(1): 27-44 (2001) - [j2]Michel Rigo:
Numeration systems on a regular language: arithmetic operations, recognizability and formal power series. Theor. Comput. Sci. 269(1-2): 469-498 (2001) - [i5]Michel Rigo:
Towards a characterization of the star-free sets of integers. CoRR cs.CC/0111057 (2001) - 2000
- [j1]Michel Rigo:
Generalization of automatic sequences for numeration systems on a regular language. Theor. Comput. Sci. 244(1-2): 271-281 (2000)
1990 – 1999
- 1999
- [i4]Michel Rigo:
Generalization of automatic sequences for numeration systems on a regular language. CoRR cs.CC/9906017 (1999) - [i3]Michel Rigo:
Construction of regular languages and recognizability of polynomials. CoRR cs.CC/9908018 (1999) - [i2]Michel Rigo:
Numeration systems on a regular language: Arithmetic operations Recognizability and Formal power series. CoRR cs.CC/9911002 (1999) - [i1]Pierre B. A. Lecomte, Michel Rigo:
Numeration systems on a regular language. CoRR cs.OH/9903005 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
