Generalized Pascal triangle for binomial coefficients of words J Leroy, M Rigo, M Stipulanti Advances in Applied Mathematics 80, 24-47, 2016 | 24 | 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 | 18 | 2017 |
Behavior of digital sequences through exotic numeration systems J Leroy, M Rigo, M Stipulanti arXiv preprint arXiv:1705.08322, 2017 | 13 | 2017 |
Counting Subwords Occurrences in Base-b Expansions J Leroy, M Rigo, M Stipulanti arXiv preprint arXiv:1705.10065, 2017 | 9 | 2017 |
Nyldon words É Charlier, M Philibert, M Stipulanti Journal of Combinatorial Theory, Series A 167, 60-90, 2019 | 7 | 2019 |
Convergence of Pascal-like triangles in Parry–Bertrand numeration systems M Stipulanti Theoretical Computer Science 758, 42-60, 2019 | 4 | 2019 |
The formal inverse of the period-doubling sequence N Rampersad, M Stipulanti arXiv preprint arXiv:1807.11899, 2018 | 4 | 2018 |
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 | 1 | 2019 |
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 | | 2019 |