| Publication | Date of Publication | Type |
|---|
$\mathcal{S}$-adic characterization of minimal dendric shifts
(available as arXiv preprint) | N/A | Paper |
Decidability of the isomorphism problem between multidimensional substitutive subshifts
(available as arXiv preprint) | N/A | Paper |
Stability properties for subgroups generated by return words
European Journal of Combinatorics | 2025-09-16 | Paper |
Decidability of the isomorphism and the factorization between minimal substitution subshifts
Discrete Analysis | 2025-08-20 | Paper |
Decidability of the isomorphism problem between multidimensional substitutive subshifts
Ergodic Theory and Dynamical Systems | 2025-06-17 | Paper |
\(\mathcal{S}\)-adic characterization of minimal dendric shifts
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2025-05-07 | Paper |
Algebraic characterization of dendricity
The Electronic Journal of Combinatorics | 2025-05-06 | Paper |
Almost everywhere balanced sequences of complexity \(2n + 1\)
Moscow Journal of Combinatorics and Number Theory | 2022-12-02 | Paper |
-adic characterization of minimal ternary dendric shifts
Ergodic Theory and Dynamical Systems | 2022-11-28 | Paper |
On the dimension group of unimodular \(\mathcal{S}\)-adic subshifts
Monatshefte für Mathematik | 2021-03-29 | Paper |
$\mathcal{S}$-adic characterization of minimal ternary dendric shifts
(available as arXiv preprint) | 2021-02-19 | Paper |
Almost everywhere balanced sequences of complexity 2n+1
(available as arXiv preprint) | 2021-02-19 | Paper |
Computing the \(k\)-binomial complexity of the Thue-Morse word
Journal of Combinatorial Theory. Series A | 2020-09-07 | Paper |
Computing the \(k\)-binomial complexity of the Thue-Morse word
Developments in Language Theory | 2019-10-15 | Paper |
Counting subword occurrences in base-b expansions
(available as arXiv preprint) | 2019-06-21 | Paper |
| Counting subword occurrences in base-b expansions | 2019-06-21 | Paper |
Computing the k-binomial complexity of the Thue--Morse word
(available as arXiv preprint) | 2018-12-18 | Paper |
Rigidity and substitutive dendric words
International Journal of Foundations of Computer Science | 2018-09-20 | Paper |
| Decidability of the isomorphism and the factorization between minimal substitution subshifts | 2018-06-13 | Paper |
A set of sequences of complexity \(2n+1\)
(available as arXiv preprint) | 2017-11-15 | Paper |
Specular sets
Theoretical Computer Science | 2017-06-15 | Paper |
Behavior of digital sequences through exotic numeration systems
The Electronic Journal of Combinatorics | 2017-04-10 | Paper |
Behavior of digital sequences through exotic numeration systems
The Electronic Journal of Combinatorics | 2017-04-10 | Paper |
Counting the number of non-zero coefficients in rows of generalized Pascal triangles
Discrete Mathematics | 2017-02-27 | Paper |
The constant of recognizability is computable for primitive morphisms
(available as arXiv preprint) | 2017-02-14 | Paper |
| The constant of recognizability is computable for primitive morphisms | 2017-02-14 | Paper |
Generalized Pascal triangle for binomial coefficients of words
Advances in Applied Mathematics | 2016-09-06 | Paper |
Bispecial factors in the Brun S-adic system
Developments in Language Theory | 2016-08-30 | Paper |
Asymptotic properties of free monoid morphisms
Linear Algebra and its Applications | 2016-04-20 | Paper |
Specular sets
Lecture Notes in Computer Science | 2015-11-04 | Paper |
Specular sets
Lecture Notes in Computer Science | 2015-11-04 | Paper |
An analogue of Cobham's theorem for graph directed iterated function systems
Advances in Mathematics | 2015-05-29 | Paper |
Acyclic, connected and tree sets
Monatshefte für Mathematik | 2015-03-31 | Paper |
The finite index basis property
Journal of Pure and Applied Algebra | 2015-02-27 | Paper |
Bifix codes and interval exchanges
Journal of Pure and Applied Algebra | 2015-02-27 | Paper |
Bifix codes and interval exchanges
Journal of Pure and Applied Algebra | 2015-02-27 | Paper |
Maximal bifix decoding
Discrete Mathematics | 2015-01-30 | Paper |
An S-adic characterization of minimal subshifts with first difference of complexity 1 p(n+1) - p(n) 2
(available as arXiv preprint) | 2014-07-01 | Paper |
| An S-adic characterization of minimal subshifts with first difference of complexity 1 p(n+1) - p(n) 2 | 2014-07-01 | Paper |
| Do the properties of an S-adic representation determine factor complexity? | 2014-03-24 | Paper |
A combinatorial proof of S-adicity for sequences with linear complexity
Integers | 2013-10-25 | Paper |
S-adic conjecture and Bratteli diagrams
Comptes Rendus. Mathématique. Académie des Sciences, Paris | 2012-12-13 | Paper |
| Towards a statement of the S-adic conjecture through examples | 2012-08-31 | Paper |
Some improvements of the S-adic conjecture
Advances in Applied Mathematics | 2011-12-08 | Paper |
