| Publication | Date of Publication | Type |
|---|
A characterization of multidimensional \(S\)-automatic sequences
Actes des rencontres du CIRM | 2018-09-18 | Paper |
Similarity relations on words
Combinatorics, Words and Symbolic Dynamics | 2017-10-06 | Paper |
A new proof for the decidability of D0L ultimate periodicity
Electronic Proceedings in Theoretical Computer Science | 2016-03-01 | Paper |
A new proof for the decidability of D0L ultimate periodicity
Electronic Proceedings in Theoretical Computer Science | 2016-03-01 | Paper |
Similarity relations and repetition-freeness
Lecture Notes in Computer Science | 2013-09-20 | Paper |
Repetition-freeness with cyclic relations and chain relations
Fundamenta Informaticae | 2012-06-20 | Paper |
On the number of frames in binary words
Theoretical Computer Science | 2011-10-10 | Paper |
The number of positions starting a square in binary words
The Electronic Journal of Combinatorics | 2011-02-17 | Paper |
The number of positions starting a square in binary words
The Electronic Journal of Combinatorics | 2011-02-17 | Paper |
A NEW PROOF OF THE THREE-SQUARES LEMMA FOR PARTIAL WORDS WITH ONE HOLE
International Journal of Foundations of Computer Science | 2011-01-19 | Paper |
On the periodicity of morphic words
Developments in Language Theory | 2010-08-31 | Paper |
Square-free partial words
Information Processing Letters | 2010-06-09 | Paper |
Multidimensional generalized automatic sequences and shape-symmetric morphic words
Discrete Mathematics | 2010-04-27 | Paper |
| On the recognizability of self-generating sets | 2010-03-30 | Paper |
| On the recognizability of self-generating sets | 2010-03-30 | Paper |
On the number of squares in partial words
RAIRO - Theoretical Informatics and Applications | 2010-03-12 | Paper |
On the Recognizability of Self-generating Sets
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
The theorem of Fine and Wilf for relational periods
RAIRO - Theoretical Informatics and Applications | 2009-05-06 | Paper |
Overlap-freeness in infinite partial words
Theoretical Computer Science | 2009-03-17 | Paper |
Relationally Periodic Sequences and Subword Complexity
Developments in Language Theory | 2008-10-30 | Paper |
Compatibility relations on codes and free monoids
RAIRO - Theoretical Informatics and Applications | 2008-09-25 | Paper |
Compatibility relations on codes and free monoids
RAIRO - Theoretical Informatics and Applications | 2008-09-25 | Paper |
| Interaction properties of relational periods | 2008-05-27 | Paper |
Defect theorems with compatibility relations.
Semigroup Forum | 2008-04-03 | Paper |
Relational codes of words
Theoretical Computer Science | 2008-01-07 | Paper |
Transcendence of numbers with an expansion in a subclass of complexity 2n + 1
RAIRO - Theoretical Informatics and Applications | 2007-02-08 | Paper |
Transcendence of numbers with an expansion in a subclass of complexity 2n + 1
RAIRO - Theoretical Informatics and Applications | 2007-02-08 | Paper |
