| Combinatorics, automata and number theory V Berthé, M Rigo Cambridge University Press, 2010 | 254 | 2010 |
| Numeration systems on a regular language PBA Lecomte, M Rigo Theory of Computing Systems 34 (1), 27-44, 2000 | 113 | 2000 |
| Formal languages, automata and numeration systems 1: Introduction to combinatorics on words M Rigo John Wiley & Sons, 2014 | 98* | 2014 |
| More on generalized automatic sequences M Rigo, A Maes Journal of Automata, Languages and Combinatorics 7 (3), 351-376, 2002 | 79 | 2002 |
| Extensions and restrictions of Wythoff's game preserving its P positions E Duchene, AS Fraenkel, RJ Nowakowski, M Rigo Journal of Combinatorial Theory, Series A 117 (5), 545-567, 2010 | 76 | 2010 |
| Another generalization of abelian equivalence: binomial complexity of infinite words M Rigo, P Salimov Theoretical Computer Science 601, 47-57, 2015 | 58 | 2015 |
| Invariant games E Duchêne, M Rigo Theoretical Computer Science 411 (34-36), 3169-3180, 2010 | 57 | 2010 |
| Generalized Pascal triangle for binomial coefficients of words J Leroy, M Rigo, M Stipulanti Advances in Applied Mathematics 80, 24-47, 2016 | 47 | 2016 |
| A morphic approach to combinatorial games: the Tribonacci case E Duchêne, M Rigo RAIRO-Theoretical Informatics and Applications 42 (2), 375-393, 2008 | 43 | 2008 |
| Generalization of automatic sequences for numeration systems on a regular language M Rigo Theoretical Computer Science 244 (1-2), 271-281, 2000 | 43 | 2000 |
| Numeration systems on a regular language: arithmetic operations, recognizability and formal power series M Rigo Theoretical Computer Science 269 (1-2), 469-498, 2001 | 41 | 2001 |
| Advanced graph theory and combinatorics M Rigo John Wiley & Sons, 2016 | 34 | 2016 |
| On the representation of real numbers using regular languages P Lecomte, M Rigo Theory of Computing Systems 35 (1), 13-38, 2002 | 33 | 2002 |
| Combinatorics, words and symbolic dynamics V Berthé, M Rigo Cambridge University Press, 2016 | 32 | 2016 |
| Multidimensional generalized automatic sequences and shape-symmetric morphic words E Charlier, T Kärki, M Rigo Discrete mathematics 310 (6-7), 1238-1252, 2010 | 32 | 2010 |
| Computing the k-binomial complexity of the Thue–Morse word M Lejeune, J Leroy, M Rigo Journal of Combinatorial Theory, Series A 176, 105284, 2020 | 30 | 2020 |
| Some properties of abelian return words M Rigo, P Salimov, É Vandomme Journal of Integer Sequences 16, 2013 | 30 | 2013 |
| A decision problem for ultimately periodic sets in nonstandard numeration systems J Bell, E Charlier, AS Fraenkel, M Rigo International Journal of Algebra and Computation 19 (06), 809-839, 2009 | 30 | 2009 |
| An analogue of Cobham's theorem for graph directed iterated function systems É Charlier, J Leroy, M Rigo Advances in Mathematics 280, 86-120, 2015 | 29 | 2015 |
| A note on syndeticity, recognizable sets and Cobham's theorem M Rigo, L Waxweiler arXiv preprint arXiv:0907.0624, 2009 | 27 | 2009 |
Valerie BertheIRIF, CNRSirif.fr의 이메일 확인됨