| Publication | Date of Publication | Type |
|---|
The subword complexity of fixed points of binary uniform morphisms
Fundamentals of Computation Theory | 2022-12-09 | Paper |
Prefix palindromic length of the Sierpinski word
(available as arXiv preprint) | 2022-08-11 | Paper |
Prefix palindromic length of the Sierpinski word
(available as arXiv preprint) | 2022-01-24 | Paper |
On prefix palindromic length of automatic words
Theoretical Computer Science | 2021-10-21 | Paper |
On prefix palindromic length of automatic words
(available as arXiv preprint) | 2020-09-07 | Paper |
Cost and dimension of words of zero topological entropy
Bulletin de la Société mathématique de France | 2020-07-22 | Paper |
| Prefix palindromic length of the Thue-Morse word | 2020-01-27 | Paper |
Prefix palindromic length of the Thue-Morse word
(available as arXiv preprint) | 2020-01-27 | Paper |
Morphic words and equidistributed sequences
Theoretical Computer Science | 2019-12-27 | Paper |
| First lower bounds for palindromic length | 2019-10-15 | Paper |
A characterization of words of linear complexity
Proceedings of the American Mathematical Society | 2019-06-26 | Paper |
The number of valid factorizations of Fibonacci prefixes
Theoretical Computer Science | 2019-05-29 | Paper |
| Quelques m\'ethodes pour les mots sturmiens | 2019-01-07 | Paper |
Sturmian numeration systems and decompositions to palindromes
European Journal of Combinatorics | 2018-05-18 | Paper |
Minimal complexity of equidistributed infinite permutations
European Journal of Combinatorics | 2017-08-31 | Paper |
Infinite permutations vs. infinite words
Electronic Proceedings in Theoretical Computer Science | 2016-03-01 | Paper |
Infinite permutations vs. infinite words
Electronic Proceedings in Theoretical Computer Science | 2016-03-01 | Paper |
Fine and Wilf's theorem for permutations
Sibirskie Elektronnye Matematicheskie Izvestiya | 2015-11-16 | Paper |
Ergodic infinite permutations of minimal complexity
Lecture Notes in Computer Science | 2015-11-10 | Paper |
Canonical representatives of morphic permutations
Lecture Notes in Computer Science | 2015-11-04 | Paper |
| Words containing all permutations of a family of factors | 2015-10-27 | Paper |
Subword complexity and decomposition of the set of factors
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
On the number of factors in codings of three interval exchange
(available as arXiv preprint) | 2014-03-25 | Paper |
| On the number of factors in codings of three interval exchange | 2014-03-25 | Paper |
On palindromic factorization of words
Advances in Applied Mathematics | 2014-01-27 | Paper |
| On minimal factorizations of words as products of palindromes | 2012-10-23 | Paper |
On automatic infinite permutations
RAIRO. Theoretical Informatics and Applications | 2012-08-31 | Paper |
On automatic infinite permutations
RAIRO. Theoretical Informatics and Applications | 2012-08-31 | Paper |
On possible growths of Toeplitz languages
Siberian Mathematical Journal | 2011-05-19 | Paper |
| On infinite permutations | 2010-07-30 | Paper |
Simple equations on binary factorial languages
Theoretical Computer Science | 2009-08-07 | Paper |
Canonical decomposition of catenation of factorial languages
Sibirskie Elektronnye Matematicheskie Izvestiya | 2008-01-18 | Paper |
Canonical decomposition of catenation of factorial languages
Sibirskie Elektronnye Matematicheskie Izvestiya | 2008-01-18 | Paper |
Commutation of Binary Factorial Languages
Developments in Language Theory | 2007-11-28 | Paper |
On periodicity and low complexity of infinite permutations
European Journal of Combinatorics | 2007-11-21 | Paper |
On the arithmetical complexity of Sturmian words
Theoretical Computer Science | 2007-07-16 | Paper |
Canonical Decomposition of a Regular Factorial Language
Computer Science – Theory and Applications | 2007-05-02 | Paper |
Sequences of low arithmetical complexity
RAIRO - Theoretical Informatics and Applications | 2007-02-20 | Paper |
Sequences of low arithmetical complexity
RAIRO - Theoretical Informatics and Applications | 2007-02-20 | Paper |
Sequences of low arithmetical complexity
RAIRO - Theoretical Informatics and Applications | 2007-02-20 | Paper |
On possible growths of arithmetical complexity
RAIRO - Theoretical Informatics and Applications | 2007-02-08 | Paper |
On possible growths of arithmetical complexity
RAIRO - Theoretical Informatics and Applications | 2007-02-08 | Paper |
On possible growths of arithmetical complexity
RAIRO - Theoretical Informatics and Applications | 2007-02-08 | Paper |
A lower bound for the arithmetical complexity of Sturmian words
Sibirskie Elektronnye Matematicheskie Izvestiya | 2006-08-24 | Paper |
Sequences of linear arithmetical complexity
Theoretical Computer Science | 2005-06-30 | Paper |
A UNIQUE DECOMPOSITION THEOREM FOR FACTORIAL LANGUAGES
International Journal of Algebra and Computation | 2005-06-07 | Paper |
Arithmetical complexity of symmetric D0L words.
Theoretical Computer Science | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 2051150 (Why is no real title available?) | 2004-03-07 | Paper |
| scientific article; zbMATH DE number 1809720 (Why is no real title available?) | 2002-09-30 | Paper |
| scientific article; zbMATH DE number 1740040 (Why is no real title available?) | 2002-05-14 | Paper |
Overlap-free symmetric D0L words
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2002-04-23 | Paper |
Overlap-free symmetric D0L words
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2002-04-23 | Paper |
On the subword complexity of iteratively generated infinite words.
Discrete Applied Mathematics | 2002-01-30 | Paper |
On factor graphs of DOL words
Discrete Applied Mathematics | 2002-01-30 | Paper |
| scientific article; zbMATH DE number 1396706 (Why is no real title available?) | 2000-01-31 | Paper |
| scientific article; zbMATH DE number 1375592 (Why is no real title available?) | 1999-12-09 | Paper |
| scientific article; zbMATH DE number 1375592 (Why is no real title available?) | 1999-12-09 | Paper |
| scientific article; zbMATH DE number 1234887 (Why is no real title available?) | 1999-05-18 | Paper |
| scientific article; zbMATH DE number 1285631 (Why is no real title available?) | 1999-05-10 | Paper |
| scientific article; zbMATH DE number 1037960 (Why is no real title available?) | 1997-07-22 | Paper |
