| Publication | Date of Publication | Type |
|---|
| Dyck Words, Lattice Paths, and Abelian Borders | 2023-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5016356 | 2021-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5016359 | 2021-12-13 | Paper |
| Pattern Avoidance in Partial Words Dense with Holes. | 2018-03-29 | Paper |
| Minimal partial languages and automata | 2018-01-10 | Paper |
| Computing generalized de Bruijn sequences | 2017-11-16 | Paper |
| Border correlations, lattices, and the subgraph component polynomial | 2017-11-14 | Paper |
| On the asymptotic abelian complexity of morphic words | 2017-10-05 | Paper |
| New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings | 2017-07-17 | Paper |
| Recurrent Partial Words and Representable Sets. | 2017-06-13 | Paper |
| New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings | 2017-03-03 | Paper |
| Computing Depths of Patterns | 2017-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2819388 | 2016-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5740407 | 2016-07-26 | Paper |
| Longest Common Extensions in Partial Words | 2016-04-04 | Paper |
| Recurrent Partial Words | 2016-03-01 | Paper |
| Combinatorics on partial word borders | 2015-12-08 | Paper |
| Squareable Words | 2015-11-10 | Paper |
| Border Correlations, Lattices, and the Subgraph Component Polynomial | 2015-09-15 | Paper |
| Computing Minimum Length Representations of Sets of Words of Uniform Length | 2015-09-15 | Paper |
| Computing Primitively-Rooted Squares and Runs in Partial Words | 2015-09-15 | Paper |
| Computing minimum length representations of sets of words of uniform length | 2015-07-24 | Paper |
| On the state complexity of partial word DFAs | 2015-05-18 | Paper |
| Squares and primitivity in partial words | 2015-04-28 | Paper |
| Minimal Partial Languages and Automata | 2014-09-26 | Paper |
| Computing the Partial Word Avoidability Indices of Ternary Patterns | 2014-08-19 | Paper |
| Computing the partial word avoidability indices of binary patterns | 2014-08-13 | Paper |
| Computing the partial word avoidability indices of ternary patterns | 2014-08-13 | Paper |
| Abelian pattern avoidance in partial words | 2014-08-08 | Paper |
| Counting minimal semi-Sturmian words | 2014-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5408177 | 2014-04-09 | Paper |
| Computing Depths of Patterns | 2014-03-31 | Paper |
| Squares in partial words | 2014-03-27 | Paper |
| Abelian periods, partial words, and an extension of a theorem of Fine and Wilf | 2014-02-24 | Paper |
| Recurrence in infinite partial words | 2014-02-11 | Paper |
| Deciding Representability of Sets of Words of Equal Length in Polynomial Time | 2014-01-17 | Paper |
| Strict bounds for pattern avoidance | 2014-01-16 | Paper |
| Abelian-primitive partial words | 2014-01-07 | Paper |
| Partial Word DFAs | 2013-08-07 | Paper |
| On the Asymptotic Abelian Complexity of Morphic Words | 2013-06-28 | Paper |
| Strict Bounds for Pattern Avoidance | 2013-06-28 | Paper |
| A note on constructing infinite binary words with polynomial subword complexity | 2013-06-18 | Paper |
| ALGORITHMIC COMBINATORICS ON PARTIAL WORDS | 2013-06-06 | Paper |
| A Graph Polynomial Approach to Primitivity | 2013-03-18 | Paper |
| Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem | 2013-03-18 | Paper |
| Deciding representability of sets of words of equal length | 2013-03-04 | Paper |
| Periods in partial words: an algorithm | 2013-01-18 | Paper |
| Squares in Binary Partial Words | 2012-11-02 | Paper |
| Deciding Representability of Sets of Words of Equal Length | 2012-11-02 | Paper |
| Abelian Pattern Avoidance in Partial Words | 2012-09-25 | Paper |
| Number of holes in unavoidable sets of partial words. I. | 2012-09-13 | Paper |
| Number of holes in unavoidable sets of partial words. II. | 2012-09-13 | Paper |
| Periodicity algorithms and a conjecture on overlaps in partial words | 2012-08-10 | Paper |
| Constructing partial words with subword complexities not achievable by full words | 2012-06-25 | Paper |
| The three-squares lemma for partial words with one hole | 2012-05-30 | Paper |
| Avoidable binary patterns in partial words | 2012-03-23 | Paper |
| Erratum to: ``Avoidable binary patterns in partial words | 2012-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113686 | 2012-01-23 | Paper |
| Periods in Partial Words: An Algorithm | 2012-01-13 | Paper |
| Abelian repetitions in partial words | 2011-12-08 | Paper |
| Avoiding Abelian squares in partial words | 2011-11-11 | Paper |
| Avoiding Abelian Powers in Partial Words | 2011-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3018955 | 2011-07-27 | Paper |
| Counting bordered partial words by critical positions | 2011-07-15 | Paper |
| Avoiding large squares in partial words | 2011-07-14 | Paper |
| Unary Pattern Avoidance in Partial Words Dense with Holes | 2011-06-03 | Paper |
| Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three | 2011-05-19 | Paper |
| On minimal Sturmian partial words | 2011-05-17 | Paper |
| On the complexity of deciding avoidability of sets of partial words | 2010-11-19 | Paper |
| FINE AND WILF'S THEOREM FOR PARTIAL WORDS WITH ARBITRARILY MANY WEAK PERIODS | 2010-11-11 | Paper |
| Border correlations of partial words | 2010-08-13 | Paper |
| Combinatorics on partial word correlations | 2010-08-11 | Paper |
| Binary De Bruijn Partial Words with One Hole | 2010-06-17 | Paper |
| Abelian Square-Free Partial Words | 2010-05-26 | Paper |
| Avoidable Binary Patterns in Partial Words | 2010-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5306171 | 2010-04-08 | Paper |
| A note on the number of squares in a partial word with one hole | 2009-12-18 | Paper |
| Unavoidable sets of partial words | 2009-10-19 | Paper |
| On the Complexity of Deciding Avoidability of Sets of Partial Words | 2009-07-07 | Paper |
| Unbordered partial words | 2009-06-30 | Paper |
| How Many Holes Can an Unbordered Partial Word Contain? | 2009-04-02 | Paper |
| An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms | 2009-04-02 | Paper |
| A generalization of Thue freeness for partial words | 2009-03-17 | Paper |
| Testing avoidability on sets of partial words is hard | 2009-03-17 | Paper |
| Equations on partial words | 2008-12-22 | Paper |
| Periodicity properties on partial words | 2008-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3527014 | 2008-09-25 | Paper |
| Graph connectivity, partial words, and a theorem of Fine and Wilf | 2008-05-19 | Paper |
| Two Element Unavoidable Sets of Partial Words | 2007-11-28 | Paper |
| Partial words and the critical factorization theorem revisited | 2007-10-18 | Paper |
| Algorithmic Combinatorics on Partial Words | 2007-10-11 | Paper |
| Equations on Partial Words | 2007-09-05 | Paper |
| Correlations of Partial Words | 2007-09-03 | Paper |
| Testing primitivity on partial words | 2007-03-02 | Paper |
| ALGORITHMS FOR APPROXIMATE K-COVERING OF STRINGS | 2005-12-15 | Paper |
| Primitive partial words | 2005-08-05 | Paper |
| Partial words and the critical factorization theorem | 2005-04-06 | Paper |
| Codes, orderings, and partial words | 2005-02-09 | Paper |
| Local periods and binary partial words: an algorithm | 2004-10-27 | Paper |
| A periodicity result of partial words with one hole | 2004-08-06 | Paper |
| Periodicity on partial words | 2004-06-15 | Paper |
| Conjugacy on partial words. | 2003-01-21 | Paper |
| On unique, multiset, and set decipherability of three-word codes | 2002-08-04 | Paper |
| Partial words and a theorem of Fine and Wilf revisited | 2002-03-03 | Paper |
| Trees, congruences and varieties of finite semigroups | 1999-01-25 | Paper |
| On semidirect and two-sided semidirect products of finite $\mathcal {J}$trivial monoids | 1998-12-09 | Paper |
| On a product of finite monoids | 1998-10-14 | Paper |
| On the semidirect product of the pseudovariety of semilattices by a locally finite pseudovariety of groups | 1998-06-11 | Paper |
| Equations on semidirect products of commutative semigroups | 1998-02-11 | Paper |
| Inclusion relations between some congruences related to the dot-depth hierarchy | 1996-07-07 | Paper |
| Equations on the semidirect product of a finite semilattice by a $\mathcal {J}$-trivial monoid of height $k$ | 1995-11-09 | Paper |
| Some logical characterizations of the dot-depth hierarchy and applications | 1995-10-25 | Paper |
| Equations on the semidirect product of a finite semilattice by a finite commutative monoid | 1995-07-19 | Paper |
| Equations and dot-depth one | 1995-06-13 | Paper |
| On a complete set of generators for dot-depth two | 1994-05-26 | Paper |
| Equations and monoid varieties of dot-depth one and two | 1994-02-22 | Paper |
| THE DOT-DEPTH OF A GENERATING CLASS OF APERIODIC MONOIDS IS COMPUTABLE | 1993-05-16 | Paper |
| Games, equations and dot-depth two monoids | 1993-01-17 | Paper |
| On dot-depth two | 1990-01-01 | Paper |
| Games, equations and the dot-depth hierarchy | 1989-01-01 | Paper |
