| Publication | Date of Publication | Type |
|---|
On the commutative equivalence of algebraic structures and related problems
Journal of Automata, Languages and Combinatorics | 2025-11-25 | Paper |
On the Riemann hypothesis and the Dedekind Psi function
Integers | 2024-05-30 | Paper |
On the Commutative Equivalence of Algebraic Formal Series and Languages
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
| Repetitions in Toeplitz words and the Thue threshold | 2022-12-16 | Paper |
Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity
Theoretical Computer Science | 2021-03-09 | Paper |
On bounded linear codes and the commutative equivalence
Theoretical Computer Science | 2021-01-25 | Paper |
Coding by minimal linear grammars
Theoretical Computer Science | 2020-08-17 | Paper |
On the length of uncompletable words in unambiguous automata
RAIRO - Theoretical Informatics and Applications | 2020-05-04 | Paper |
| Locally strongly transitive automata in the Černý conjecture and related problems | 2020-01-15 | Paper |
| On the commutative equivalence of bounded semi-linear codes | 2019-11-06 | Paper |
| On the commutative equivalence of context-free languages | 2018-11-22 | Paper |
On incomplete and synchronizing finite sets
Theoretical Computer Science | 2017-03-16 | Paper |
Universal Lyndon words
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Independent sets of words and the synchronization problem
Advances in Applied Mathematics | 2013-03-06 | Paper |
On factors of synchronized sequences
Theoretical Computer Science | 2012-04-03 | Paper |
On the hybrid Černý-road coloring problem and Hamiltonian paths
Developments in Language Theory | 2010-08-31 | Paper |
On a word avoiding near repeats
Information Processing Letters | 2010-08-20 | Paper |
Strongly transitive automata and the Černý conjecture
Acta Informatica | 2009-11-18 | Paper |
The Synchronization Problem for Locally Strongly Transitive Automata
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
ON THE REPETITIVITY INDEX OF INFINITE WORDS
International Journal of Algebra and Computation | 2009-06-30 | Paper |
The Synchronization Problem for Strongly Transitive Automata
Developments in Language Theory | 2008-10-30 | Paper |
On Dejean's conjecture over large alphabets
Theoretical Computer Science | 2007-10-18 | Paper |
On the Repetition Threshold for Large Alphabets
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Farey codes and languages
European Journal of Combinatorics | 2006-12-07 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2006-06-23 | Paper |
Codes of central Sturmian words
Theoretical Computer Science | 2005-08-01 | Paper |
REPETITIONS, FULLNESS, AND UNIFORMITY IN TWO-DIMENSIONAL WORDS
International Journal of Foundations of Computer Science | 2005-06-22 | Paper |
| scientific article; zbMATH DE number 2174395 (Why is no real title available?) | 2005-06-08 | Paper |
Completions in measure of languages and related combinatorial problems
Theoretical Computer Science | 2005-02-22 | Paper |
Uniform words
Advances in Applied Mathematics | 2004-10-12 | Paper |
Harmonic and gold Sturmian words
European Journal of Combinatorics | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2051162 (Why is no real title available?) | 2004-03-07 | Paper |
On the distribution of characteristic parameters of words
RAIRO - Theoretical Informatics and Applications | 2003-07-15 | Paper |
On the distribution of characteristic parameters of words
RAIRO - Theoretical Informatics and Applications | 2003-07-15 | Paper |
| Special factors in some combinatorial structures | 2003-07-09 | Paper |
A combinatorial property of the factor poset of a word
Information Processing Letters | 2003-06-24 | Paper |
Semiperiodic words and root-conjugacy.
Theoretical Computer Science | 2003-01-22 | Paper |
| scientific article; zbMATH DE number 1759413 (Why is no real title available?) | 2002-11-04 | Paper |
Some generalizations of periodic words
Bulletin of the Belgian Mathematical Society - Simon Stevin | 2002-10-10 | Paper |
On synchronized sequences and their separators
RAIRO - Theoretical Informatics and Applications | 2002-10-09 | Paper |
On synchronized sequences and their separators
RAIRO - Theoretical Informatics and Applications | 2002-10-09 | Paper |
On synchronized sequences and their separators
RAIRO - Theoretical Informatics and Applications | 2002-10-09 | Paper |
Words, univalent factors, and boxes
Acta Informatica | 2002-08-14 | Paper |
Special factors and uniqueness conditions in rational trees
Theory of Computing Systems | 2002-05-05 | Paper |
On the distribution of characteristic parameters of words II
RAIRO - Theoretical Informatics and Applications | 2002-01-01 | Paper |
On the distribution of characteristic parameters of words II
RAIRO - Theoretical Informatics and Applications | 2002-01-01 | Paper |
On the distribution of characteristic parameters of words II
RAIRO - Theoretical Informatics and Applications | 2002-01-01 | Paper |
Words and special factors
Theoretical Computer Science | 2001-08-20 | Paper |
Periodic-like words, periodicity, and boxes
Acta Informatica | 2001-08-20 | Paper |
Special factors, periodicity, and an application to Sturmian words
Acta Informatica | 2000-09-04 | Paper |
On repeated factors in \(C^\infty\)-words
Information Processing Letters | 2000-06-21 | Paper |
| scientific article; zbMATH DE number 1408354 (Why is no real title available?) | 2000-02-29 | Paper |
On Abelian squares and substitutions
Theoretical Computer Science | 1999-06-21 | Paper |
Words and repeated factors
Séminaire Lotharingien de Combinatoire | 1999-06-16 | Paper |
Words and repeated factors
Séminaire Lotharingien de Combinatoire | 1999-06-16 | Paper |
On the number of Abelian square-free words on four letters
Discrete Applied Mathematics | 1998-03-25 | Paper |
ON REPRESENTATION SYSTEMS
International Journal of Algebra and Computation | 1995-10-29 | Paper |
ON ABELIAN POWER-FREE MORPHISMS
International Journal of Algebra and Computation | 1993-11-01 | Paper |
Overlap-free words and finite automata
Theoretical Computer Science | 1993-09-16 | Paper |
Non-repetitive words relative to a rewriting system
Theoretical Computer Science | 1990-01-01 | Paper |
Multidimensional unrepetitive configurations
Theoretical Computer Science | 1988-01-01 | Paper |
On synchronizing unambiguous automata
Theoretical Computer Science | 1988-01-01 | Paper |
On unambiguous reductions of monoids of unambiguous relations
Theoretical Computer Science | 1987-01-01 | Paper |
Square-free words on partially commutative free monoids
Information Processing Letters | 1986-01-01 | Paper |
On the centers of the set of weakly square-free words on a two letter alphabet
Information Processing Letters | 1984-01-01 | Paper |
On the size of a square-free morphism on a three letter alphabet
Information Processing Letters | 1983-01-01 | Paper |
