Acyclic, connected and tree sets V Berthé, C De Felice, F Dolce, J Leroy, D Perrin, C Reutenauer, ...
Monatshefte für Mathematik 176 (4), 2015
70 2015 Do the Properties of an S-adic Representation Determine Factor Complexity? F Durand, J Leroy, G Richomme
Journal of Integer Sequences 16 (2), 3, 2013
56 2013 Generalized Pascal triangle for binomial coefficients of words J Leroy, M Rigo, M Stipulanti
Advances in Applied Mathematics 80, 24-47, 2016
47 2016 Maximal bifix decoding V Berthé, C De Felice, F Dolce, J Leroy, D Perrin, C Reutenauer, ...
Discrete Mathematics 338 (5), 2015
44 2015 Some improvements of the S-adic conjecture J Leroy
Advances in Applied Mathematics 48 (1), 79-98, 2012
40 2012 The finite index basis property V Berthé, C De Felice, F Dolce, J Leroy, D Perrin, C Reutenauer, ...
Journal of Pure and Applied Algebra 219 (7), 2521-2537, 2015
33 2015 Bifix codes and interval exchanges V Berthé, C De Felice, F Dolce, J Leroy, D Perrin, C Reutenauer, ...
Journal of Pure and Applied Algebra 219 (7), 2781-2798, 2015
31 2015 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 Set of Sequences of Complexity J Cassaigne, S Labbé, J Leroy
International Conference on Combinatorics on Words, 144-156, 2017
25 2017 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 An S-adic characterization of minimal subshifts with first difference of complexity 1≤ p (n+ 1)-p (n)≤ 2 J Leroy
Discrete Mathematics & Theoretical Computer Science 16 (1), 233-286, 2014
24 2014 Specular sets V Berthé, C De Felice, V Delecroix, F Dolce, J Leroy, D Perrin, G Rindone
Theoretical Computer Science 684 (7), 2017
18 * 2017 S-adic conjecture and Bratteli diagrams F Durand, J Leroy
Comptes Rendus Mathematique 350 (21-22), 979-983, 2012
18 2012 Specular sets V Berthé, C De Felice, V Delecroix, F Dolce, J Leroy, D Perrin, ...
Lecture Notes in Computer Science 9304, 2015
17 2015 The constant of recognizability is computable for primitive morphisms F Durand, J Leroy
Journal of Integer Sequences 20 (4), 2017
16 2017 A combinatorial proof of s-adicity for sequences with linear complexity J Leroy, G Richomme
Integers: Annual 2013, 50, 2014
16 2014 Behavior of digital sequences through exotic numeration systems J Leroy, M Rigo, M Stipulanti
the electronic journal of combinatorics 24 (1), 2017
15 2017 Asymptotic properties of free monoid morphisms E Charlier, J Leroy, M Rigo
Linear Algebra and its Applications 500, 119-148, 2016
12 2016 Contribution to the resolution of the S-adic conjecture J Leroy
PhD thesis, Université de Picardie Jules Verne, 2012
11 * 2012 Counting Subwords Occurrences in Base-b Expansions J Leroy, M Rigo, M Stipulanti
arXiv preprint arXiv:1705.10065, 2017
6 2017 
Michel RigoDepartment of Mathematics, University of LiègeAdresse e-mail validée de ulg.ac.be
