| Publication | Date of Publication | Type |
|---|
| On the Commutative Equivalence of Algebraic Formal Series and Languages | 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 | 2021-03-09 | Paper |
| On bounded linear codes and the commutative equivalence | 2021-01-25 | Paper |
| Coding by minimal linear grammars | 2020-08-17 | Paper |
| On the length of uncompletable words in unambiguous automata | 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 | 2017-03-16 | Paper |
| Universal Lyndon Words | 2014-10-14 | Paper |
| Independent sets of words and the synchronization problem | 2013-03-06 | Paper |
| On factors of synchronized sequences | 2012-04-03 | Paper |
| On the Hybrid Černý-Road Coloring Problem and Hamiltonian Paths | 2010-08-31 | Paper |
| On a word avoiding near repeats | 2010-08-20 | Paper |
| Strongly transitive automata and the Černý conjecture | 2009-11-18 | Paper |
| The Synchronization Problem for Locally Strongly Transitive Automata | 2009-10-16 | Paper |
| ON THE REPETITIVITY INDEX OF INFINITE WORDS | 2009-06-30 | Paper |
| The Synchronization Problem for Strongly Transitive Automata | 2008-10-30 | Paper |
| On Dejean's conjecture over large alphabets | 2007-10-18 | Paper |
| On the Repetition Threshold for Large Alphabets | 2007-09-05 | Paper |
| Farey codes and languages | 2006-12-07 | Paper |
| Developments in Language Theory | 2006-06-23 | Paper |
| Codes of central Sturmian words | 2005-08-01 | Paper |
| REPETITIONS, FULLNESS, AND UNIFORMITY IN TWO-DIMENSIONAL WORDS | 2005-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4681898 | 2005-06-08 | Paper |
| Completions in measure of languages and related combinatorial problems | 2005-02-22 | Paper |
| Uniform words | 2004-10-12 | Paper |
| Harmonic and gold Sturmian words | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453453 | 2004-03-07 | Paper |
| On the distribution of characteristic parameters of words | 2003-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708946 | 2003-07-09 | Paper |
| A combinatorial property of the factor poset of a word | 2003-06-24 | Paper |
| Semiperiodic words and root-conjugacy. | 2003-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536362 | 2002-11-04 | Paper |
| Some generalizations of periodic words | 2002-10-10 | Paper |
| On synchronized sequences and their separators | 2002-10-09 | Paper |
| Words, univalent factors, and boxes | 2002-08-14 | Paper |
| Special factors and uniqueness conditions in rational trees | 2002-05-05 | Paper |
| On the distribution of characteristic parameters of words II | 2002-01-01 | Paper |
| Words and special factors | 2001-08-20 | Paper |
| Periodic-like words, periodicity, and boxes | 2001-08-20 | Paper |
| Special factors, periodicity, and an application to Sturmian words | 2000-09-04 | Paper |
| On repeated factors in \(C^\infty\)-words | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941169 | 2000-02-29 | Paper |
| On Abelian squares and substitutions | 1999-06-21 | Paper |
| Words and repeated factors | 1999-06-16 | Paper |
| On the number of Abelian square-free words on four letters | 1998-03-25 | Paper |
| ON REPRESENTATION SYSTEMS | 1995-10-29 | Paper |
| ON ABELIAN POWER-FREE MORPHISMS | 1993-11-01 | Paper |
| Overlap-free words and finite automata | 1993-09-16 | Paper |
| Non-repetitive words relative to a rewriting system | 1990-01-01 | Paper |
| Multidimensional unrepetitive configurations | 1988-01-01 | Paper |
| On synchronizing unambiguous automata | 1988-01-01 | Paper |
| On unambiguous reductions of monoids of unambiguous relations | 1987-01-01 | Paper |
| Square-free words on partially commutative free monoids | 1986-01-01 | Paper |
| On the centers of the set of weakly square-free words on a two letter alphabet | 1984-01-01 | Paper |
| On the size of a square-free morphism on a three letter alphabet | 1983-01-01 | Paper |
