| Generalized Pascal triangle for binomial coefficients of words J Leroy, M Rigo, M Stipulanti Advances in Applied Mathematics 80, 24-47, 2016 | 45 | 2016 |
| Counting the number of non-zero coefficients in rows of generalized Pascal triangles J Leroy, M Rigo, M Stipulanti Discrete Mathematics 340 (5), 862-881, 2017 | 24 | 2017 |
| Nyldon words É Charlier, M Philibert, M Stipulanti Journal of Combinatorial Theory, Series A 167, 60-90, 2019 | 19 | 2019 |
| Behavior of digital sequences through exotic numeration systems J Leroy, M Rigo, M Stipulanti Electron. J. Combin. 24 (1), Paper 1.44, 36 pp., 2017 | 15 | 2017 |
| Palindromic Ziv–Lempel and Crochemore factorizations of m-bonacci infinite words M Jahannia, M Mohammad-noori, N Rampersad, M Stipulanti Theoretical Computer Science 790, 16-40, 2019 | 9 | 2019 |
| String Attractors of Fixed Points of k-Bonacci-Like Morphisms F Gheeraert, G Romana, M Stipulanti International Conference on Combinatorics on Words, 192-205, 2023 | 8 | 2023 |
| Convergence of Pascal-like triangles in Parry–Bertrand numeration systems M Stipulanti Theoretical Computer Science 758, 42-60, 2019 | 7 | 2019 |
| The formal inverse of the period-doubling sequence N Rampersad, M Stipulanti J. Integer Seq. 21, Article 18.9.1, 22 pp., 2018 | 7 | 2018 |
| Closed Ziv–Lempel factorization of the m-bonacci words M Jahannia, M Mohammad-Noori, N Rampersad, M Stipulanti Theoretical Computer Science 918, 32-47, 2022 | 6 | 2022 |
| Binomial complexities of Parikh-Collinear Morphisms M Rigo, M Stipulanti, MA Whiteland arXiv:2201.04603, 2022 | 6 | 2022 |
| Counting Subwords Occurrences in Base-b Expansions J Leroy, M Rigo, M Stipulanti Integers 18 (A), Paper No. A13, 32 pp, 2018 | 6 | 2018 |
| A full characterization of Bertrand numeration systems É Charlier, C Cisternino, M Stipulanti International Conference on Developments in Language Theory, 102-114, 2022 | 5 | 2022 |
| Avoiding 5/4-powers on the alphabet of nonnegative integers E Rowland, M Stipulanti Electron. J. Combin. 27 (3), Paper 3.42, 39 pp, 2020 | 5 | 2020 |
| Automatic sequences: from rational bases to trees M Rigo, M Stipulanti Discrete Mathematics & Theoretical Computer Science 24 (Automata, Logic and …, 2022 | 4 | 2022 |
| Regular sequences and synchronized sequences in abstract numeration systems É Charlier, C Cisternino, M Stipulanti Eur. J. Comb. 101, 103475, 2022 | 4 | 2022 |
| Cobham’s theorem and automaticity L Mol, N Rampersad, J Shallit, M Stipulanti International Journal of Foundations of Computer Science 30 (08), 1363-1379, 2019 | 3 | 2019 |
| On digital sequences associated with Pascal's triangle P Mathonet, M Rigo, M Stipulanti, N Zénaïdi arXiv:2201.06636, 2022 | 2 | 2022 |
| Revisiting regular sequences in light of rational base numeration systems M Rigo, M Stipulanti Discrete Math. 345, 112735, 2022 | 1 | 2022 |
| Robustness of Pisot-regular sequences É Charlier, C Cisternino, M Stipulanti Advances in Applied Mathematics 125, 102151, 2021 | 1 | 2021 |
| Magic numbers in periodic sequences S Kreczman, L Prigioniero, E Rowland, M Stipulanti International Conference on Combinatorics on Words, 206-219, 2023 | | 2023 |
Michel RigoDepartment of Mathematics, University of Liège在 ulg.ac.be 的电子邮件经过验证
