| Publication | Date of Publication | Type |
|---|
| Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time | 2024-02-16 | Paper |
| Binary codes that do not preserve primitivity | 2023-08-04 | Paper |
| Formalization of Basic Combinatorics on Words | 2023-06-20 | Paper |
| Binary codes that do not preserve primitivity | 2022-12-07 | Paper |
| Lyndon words formalized in Isabelle/HOL | 2022-03-25 | Paper |
| Maximal state complexity and generalized de Bruijn words | 2022-03-14 | Paper |
| The intersection of \(3\)-maximal submonoids | 2022-01-18 | Paper |
| Binary intersection formalized | 2021-04-14 | Paper |
| The Intersection of $3$-Maximal Submonids | 2020-08-04 | Paper |
| Generalized de Bruijn words and the state complexity of conjugate sets | 2020-05-12 | Paper |
| Pseudo-solutions of word equations | 2020-03-12 | Paper |
| Binary intersection revisited | 2019-11-06 | Paper |
| On the height of towers of subsequences and prefixes | 2019-09-17 | Paper |
| Maximal State Complexity and Generalized de Bruijn Words | 2019-03-13 | Paper |
| Binary equality words with two $b$'s | 2018-09-20 | Paper |
| Periods and borders of random words | 2018-01-24 | Paper |
| Commutation and beyond (extended abstract) | 2017-11-15 | Paper |
| Formalizing a fragment of combinatorics on words | 2017-08-04 | Paper |
| Prefix frequency of lost positions | 2017-06-15 | Paper |
| Fully bordered words | 2017-06-15 | Paper |
| A presentation of a finitely generated submonoid of invertible endomorphisms of the free monoid | 2017-02-24 | Paper |
| Equation $$x^iy^jx^k=u^iv^ju^k$$ in Words | 2016-04-08 | Paper |
| Algebraic properties of word equations | 2015-05-06 | Paper |
| Words with unbounded periodicity complexity | 2014-12-12 | Paper |
| On Upper and Lower Bounds on the Length of Alternating Towers | 2014-10-14 | Paper |
| Universal Lyndon Words | 2014-10-14 | Paper |
| Complexity of testing morphic primitivity | 2013-06-14 | Paper |
| LARGE SIMPLE BINARY EQUALITY WORDS | 2013-06-06 | Paper |
| Abelian powers in paper-folding words | 2013-04-15 | Paper |
| On an algorithm for multiperiodic words | 2012-12-29 | Paper |
| Corrigendum: On multiperiodic words | 2012-02-28 | Paper |
| The Ehrenfeucht-Silberger problem | 2012-02-11 | Paper |
| ON PARTITIONS SEPARATING WORDS | 2012-01-16 | Paper |
| BINARY MORPHISMS WITH STABLE SUFFIX COMPLEXITY | 2011-05-10 | Paper |
| REDUCTION TREE OF THE BINARY GENERALIZED POST CORRESPONDENCE PROBLEM | 2011-03-30 | Paper |
| ON THE RELATION BETWEEN PERIODICITY AND UNBORDERED FACTORS OF FINITE WORDS | 2010-09-06 | Paper |
| INTRICACIES OF SIMPLE WORD EQUATIONS: AN EXAMPLE | 2010-01-29 | Paper |
| Polynomial-time algorithm for fixed points of nontrivial morphisms | 2009-12-15 | Paper |
| The Ehrenfeucht-Silberger Problem | 2009-07-14 | Paper |
| On highly palindromic words | 2009-06-30 | Paper |
| On the Relation between Periodicity and Unbordered Factors of Finite Words | 2008-10-30 | Paper |
| Large Simple Binary Equality Words | 2008-10-30 | Paper |
| Parikh test sets for commutative languages | 2008-09-25 | Paper |
| On systems of word equations with simple loop sets | 2007-07-16 | Paper |
| On multiperiodic words | 2007-02-20 | Paper |
| A proof of the extended Duval's conjecture | 2005-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453475 | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4412116 | 2003-07-13 | Paper |
| Binary equality sets are generated by two words | 2003-04-02 | Paper |
| Linear size test sets for certain commutative languages | 2002-09-24 | Paper |
| Local and global cyclicity in free semigroups | 2002-03-03 | Paper |
| In search of a word with special combinatorial properties | 2001-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263739 | 1999-11-01 | Paper |
