| Publication | Date of Publication | Type |
|---|
| Reconstructing words using queries on subwords or factors | 2024-10-08 | Paper |
| Reconstructing words using queries on subwords or factors | 2023-01-04 | Paper |
Some trace monoids where both the star problem and the finite power property problem are decidable (extended abstract)
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
A characterization of binary morphisms generating Lyndon infinite words
(available as arXiv preprint) | 2022-05-20 | Paper |
On sets of indefinitely desubstitutable words
Theoretical Computer Science | 2021-01-25 | Paper |
Coverability and multi-scale coverability on infinite pictures
Journal of Computer and System Sciences | 2019-06-25 | Paper |
Characterization of infinite LSP words and endomorphisms preserving the LSP property
International Journal of Foundations of Computer Science | 2019-06-24 | Paper |
Computing the closure of sets of words under partial commutations
Automata, Languages and Programming | 2019-01-10 | Paper |
Greedy palindromic lengths
International Journal of Foundations of Computer Science | 2018-05-17 | Paper |
Avoidability of circular formulas
Theoretical Computer Science | 2018-04-16 | Paper |
| Determining sets of quasiperiods of infinite words | 2018-03-21 | Paper |
A characterization of infinite LSP words
(available as arXiv preprint) | 2017-10-13 | Paper |
Periodicity in rectangular arrays
Information Processing Letters | 2016-11-23 | Paper |
Coverability in two dimensions
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Minimal critical exponent of quasiperiodic words
Theoretical Computer Science | 2014-08-27 | 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 |
On quasiperiodic morphisms
Lecture Notes in Computer Science | 2013-09-20 | Paper |
| Towards a statement of the S-adic conjecture through examples | 2012-08-31 | Paper |
Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms
Theoretical Computer Science | 2012-05-30 | Paper |
Counting distinct palindromes in a word in linear time
Information Processing Letters | 2012-03-27 | Paper |
On factorially balanced sets of words
Theoretical Computer Science | 2011-10-10 | Paper |
AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
International Journal of Foundations of Computer Science | 2011-07-14 | Paper |
Abelian complexity of minimal subshifts
Journal of the London Mathematical Society | 2011-02-09 | Paper |
Optimality of some algorithms to detect quasiperiodicities
Theoretical Computer Science | 2010-08-11 | Paper |
Balance and abelian complexity of the Tribonacci word
Advances in Applied Mathematics | 2010-07-13 | Paper |
Standard factors of Sturmian words
RAIRO - Theoretical Informatics and Applications | 2010-03-12 | Paper |
Standard factors of Sturmian words
RAIRO - Theoretical Informatics and Applications | 2010-03-12 | Paper |
| scientific article; zbMATH DE number 5605121 (Why is no real title available?) | 2009-09-19 | Paper |
Directive words of episturmian words: equivalences and normalization
RAIRO - Theoretical Informatics and Applications | 2009-05-06 | Paper |
Directive words of episturmian words: equivalences and normalization
RAIRO - Theoretical Informatics and Applications | 2009-05-06 | Paper |
Directive words of episturmian words: equivalences and normalization
RAIRO - Theoretical Informatics and Applications | 2009-05-06 | Paper |
| Abelian Properties of Words (Extended abstract) | 2009-04-19 | Paper |
Well Quasi Orders and the Shuffle Closure of Finite Sets
Developments in Language Theory | 2009-03-26 | Paper |
Quasiperiodic and Lyndon episturmian words
Theoretical Computer Science | 2009-01-08 | Paper |
Quasiperiodic and Lyndon episturmian words
Theoretical Computer Science | 2009-01-08 | Paper |
| On morphisms preserving infinite {L}yndon words | 2008-05-27 | Paper |
A Local Balance Property of Episturmian Words
Developments in Language Theory | 2007-11-28 | Paper |
Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms
Discrete Applied Mathematics | 2007-09-19 | Paper |
Well quasi-orders generated by a word-shuffle rewriting
Theoretical Computer Science | 2007-06-06 | Paper |
CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS
International Journal of Foundations of Computer Science | 2005-06-22 | Paper |
Overlap-free morphisms and finite test-sets
Discrete Applied Mathematics | 2004-11-23 | Paper |
Some algorithms to compute the conjugates of Episturmian morphisms
RAIRO - Theoretical Informatics and Applications | 2004-05-18 | Paper |
Some algorithms to compute the conjugates of Episturmian morphisms
RAIRO - Theoretical Informatics and Applications | 2004-05-18 | Paper |
Some algorithms to compute the conjugates of Episturmian morphisms
RAIRO - Theoretical Informatics and Applications | 2004-05-18 | Paper |
| scientific article; zbMATH DE number 2051165 (Why is no real title available?) | 2004-03-07 | Paper |
| scientific article; zbMATH DE number 1929972 (Why is no real title available?) | 2003-06-18 | Paper |
Some results on \(k\)-power-free morphisms
Theoretical Computer Science | 2002-07-15 | Paper |
| scientific article; zbMATH DE number 1500510 (Why is no real title available?) | 2001-05-03 | Paper |
Characterization of test-sets for overlap-free morphisms
Discrete Applied Mathematics | 2000-10-17 | Paper |
| scientific article; zbMATH DE number 1343488 (Why is no real title available?) | 1999-09-22 | Paper |
New results on the star problem in trace monoids
Information and Computation | 1995-08-02 | Paper |
