Julien • Cassaigne
Chargé de Recherche (CR) • Affiliation : Centre National Recherche Scientifique (CNRS)
Site : Luminy • Bureau : 209 • Etage du bureau : 2 •
Co-responsable du groupe GDAC (depuis 2015).
Groupe(s) scientifiques(s) de l'utilisateur :
Rechercher mots clef :
- Symbolic dynamic Factor complexity Cyclic complexity Sturmian words Infinite words Avoidability in words Turing machines
Thématiques scientifiques :
- Cryptography
- Theoretical computer science, computability
- Discrete mathematics
- Measured dynamic systems
- Geometric dynamic systems
- Symbolic dynamic systems
- Analytical number theory
Publications HAL
2021/02 - Almost everywhere balanced sequences of complexity $2n+1$2020/12 - Symbolic coding of linear complexity for generic translations of the torus, using continued fractions
2020/01 Quaestiones Mathematicae - On the symmetric intersection of Rauzy fractals associated with the k-bonacci substitution
2020/01 Transactions of the American Mathematical Society - On the computational complexity of algebraic numbers : the Hartmanis-Stearns problem revisited
2020/01 Annali della Scuola Normale Superiore di Pisa - ARNOUX-RAUZY INTERVAL EXCHANGE TRANSFORMATIONS
2019/12 Bulletin de la société mathématique de France - Cost and dimension of words of zero topological entropy
2019/11 Theoretical Computer Science - On abelian saturated infinite words
2019/07 Proceedings of the American Mathematical Society - A characterization of words of linear complexity
2019/07 Proceedings of the American Mathematical Society - A characterization of words of linear complexity
2019/01 Proceedings of the American Mathematical Society - A characterization of words of linear complexity
2019/01 Bulletin de la société mathématique de France - Cost and dimension of words of zero topological entropy
2018/06 Information and Computation - On k-abelian palindromes
2017/10 European Journal of Combinatorics - On growth and fluctuation of k-abelian complexity
2017/01 Journal of Combinatorial Theory, Series A - Cyclic complexity of words
2017/01 Journal of Computer and System Sciences - A Small Minimal Aperiodic Reversible Turing Machine
2016/08 International Journal of Foundations of Computer Science - Abelian Complexity and Frequencies of Letters in Infinite Words
2016/07 - k-Abelian Equivalence and Rationality
2016/07 - Cost and dimension of words of zero topological entropy
2016/01 SIAM Journal on Discrete Mathematics - Invariant games and non-homogeneous Beatty sequences
2014/08 - Cyclic Complexity of Words
2014/08 - Subword complexity and decomposition of the set of factors
2013/06 International Journal of Algebra and Computation - Balance properties of Arnoux-Rauzy words
2011/01 International Journal of Foundations of Computer Science - Avoiding Abelian Powers in Binary Words with Bounded Abelian Complexity
2011/01 European Journal of Combinatorics - Combinatorial trees arising in the study of interval exchange transformations
2011/01 Journal of the London Mathematical Society - Outer billiard outside regular polygons
2011/01 European Journal of Combinatorics - Combinatorial trees arising in the study of interval exchange transformations
2010/01 Journal de Théorie des Nombres de Bordeaux - Propriétés et limites de la reconnaissance d'ensembles d'entiers par automates dénombrables
2007/01 RAIRO - Theoretical Informatics and Applications (RAIRO: ITA) - Substitutions par des Motifs en Dimension 1
2006/01 - Diophantine properties of real numbers generated by finite automata
2001/01 International Journal of Algebra and Computation - The chinese monoid
2000/01 Acta Arithmetica - On finite pseudorandom binary sequences IV: The Liouville function, II
1998/01 Acta Arithmetica - On finite pseudorandom binary sequences III: The Liouville function, I