| Publication | Date of Publication | Type |
|---|
| Decidable problems in substitution shifts | 2024-04-09 | Paper |
| Recognizability of morphisms | 2023-12-15 | Paper |
| A new class of string transformations for compressed text indexing | 2023-09-27 | Paper |
| String attractors and infinite words | 2023-07-26 | Paper |
| Reducing the local alphabet size in tiling systems by means of 2D comma-free codes | 2022-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088889 | 2022-07-18 | Paper |
| A note on one-sided recognizable morphisms | 2022-04-08 | Paper |
| Reducing local alphabet size in recognizable picture languages | 2022-03-25 | Paper |
| Primitive sets of words | 2021-04-14 | Paper |
| Unambiguously coded shifts | 2021-03-01 | Paper |
| A combinatorial view on string attractors | 2020-12-16 | Paper |
| Some Investigations on Similarity Measures Based on Absent Words | 2020-06-21 | Paper |
| The alternating BWT: an algorithmic perspective | 2020-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5207880 | 2020-01-13 | Paper |
| Obituary: Aldo de Luca 1941--2018 | 2019-11-07 | Paper |
| On sets of words of rank two | 2019-11-06 | Paper |
| Minimal forbidden factors of circular words | 2019-10-07 | Paper |
| On generalized Lyndon words | 2019-06-18 | Paper |
| Some variations on Lyndon words | 2019-04-01 | Paper |
| Block sorting-based transformations on words: beyond the magic BWT | 2018-11-22 | Paper |
| Birecurrent sets | 2018-07-12 | Paper |
| Anti-powers in infinite words | 2018-04-27 | Paper |
| On Fixed Points of the Burrows-Wheeler Transform | 2018-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598266 | 2017-12-19 | Paper |
| Minimal forbidden words and symbolic dynamics | 2017-11-16 | Paper |
| Minimal forbidden factors of circular words | 2017-11-15 | Paper |
| Burrows-Wheeler transform and run-length enconding | 2017-11-15 | Paper |
| Measuring the clustering effect of BWT via RLE | 2017-11-06 | Paper |
| On the decomposition of prefix codes | 2017-03-16 | Paper |
| Automata and forbidden words | 2016-06-09 | Paper |
| The Shuffle Product: New Research Directions | 2016-04-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2949152 | 2015-10-07 | Paper |
| SORTING CONJUGATES AND SUFFIXES OF WORDS IN A MULTISET | 2015-04-23 | Paper |
| Suffix array and Lyndon factorization of a text | 2014-09-05 | Paper |
| A NEW COMPLEXITY FUNCTION FOR WORDS BASED ON PERIODICITY | 2013-07-30 | Paper |
| Suffixes, Conjugates and Lyndon Words | 2013-06-28 | Paper |
| Characteristic Sturmian words are extremal for the critical factorization theorem | 2012-10-11 | Paper |
| Dictionary-symbolwise flexible parsing | 2012-09-13 | Paper |
| On the product of balanced sequences | 2012-08-31 | Paper |
| A bijection between words and multisets of necklaces | 2012-08-14 | Paper |
| Nondeterministic Moore automata and Brzozowski's minimization algorithm | 2012-08-09 | Paper |
| Extremal minimality conditions on automata | 2012-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2893297 | 2012-06-20 | Paper |
| A note on Sturmian words | 2012-05-30 | Paper |
| A graph theoretic approach to automata minimality | 2012-05-30 | Paper |
| Some Remarks on Automata Minimality | 2011-07-29 | Paper |
| Nondeterministic Moore Automata and Brzozowski’s Algorithm | 2011-07-29 | Paper |
| Balancing and clustering of words in the Burrows-Wheeler transform | 2011-06-16 | Paper |
| Hopcroft's algorithm and tree-like automata | 2011-06-10 | Paper |
| Dictionary-Symbolwise Flexible Parsing | 2011-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3086926 | 2011-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3077323 | 2011-02-22 | Paper |
| The expressive power of the shuffle product | 2010-10-22 | Paper |
| On extremal cases of Hopcroft's algorithm | 2010-10-07 | Paper |
| BALANCE PROPERTIES AND DISTRIBUTION OF SQUARES IN CIRCULAR WORDS | 2010-09-06 | Paper |
| Automata with Extremal Minimality Conditions | 2010-08-31 | Paper |
| A periodicity theorem on words and applications | 2010-06-17 | Paper |
| Distance measures for biological sequences: some recent approaches | 2010-03-18 | Paper |
| CODING PARTITIONS OF REGULAR SETS | 2010-02-19 | Paper |
| Circular Sturmian words and Hopcroft's algorithm | 2009-10-09 | Paper |
| Burrows-Wheeler transform and palindromic richness | 2009-08-07 | Paper |
| On Extremal Cases of Hopcroft’s Algorithm | 2009-07-09 | Paper |
| Balanced Words Having Simple Burrows-Wheeler Transform | 2009-07-07 | Paper |
| Burrows-Wheeler transform and Sturmian words | 2009-03-23 | Paper |
| Hopcroft’s Algorithm and Cyclic Automata | 2008-11-20 | Paper |
| Balance Properties and Distribution of Squares in Circular Words | 2008-10-30 | Paper |
| An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid | 2008-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387722 | 2008-05-27 | Paper |
| A new combinatorial approach to sequence comparison | 2008-04-11 | Paper |
| From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization | 2007-12-19 | Paper |
| An extension of the Burrows-Wheeler transform | 2007-12-19 | Paper |
| Coding Partitions: Regularity, Maximality and Global Ambiguity | 2007-11-28 | Paper |
| Languages with mismatches | 2007-10-18 | Paper |
| Varieties of codes and Kraft inequality | 2007-08-23 | Paper |
| Combinatorial aspects of \(L\)-convex polyominoes | 2007-07-27 | Paper |
| Reconstruction of L-convex Polyominoes | 2007-05-29 | Paper |
| Unambiguous recognizable two-dimensional languages | 2007-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3416090 | 2007-01-19 | Paper |
| Theoretical Computer Science | 2006-11-01 | Paper |
| Word assembly through minimal forbidden words | 2006-09-14 | Paper |
| A reconstruction algorithm for L-convex polyominoes. | 2006-05-18 | Paper |
| Enumeration of L-convex polyominoes by rows and columns | 2005-12-29 | Paper |
| Combinatorial Pattern Matching | 2005-12-14 | Paper |
| Machines, Computations, and Universality | 2005-12-08 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Discrete Geometry for Computer Imagery | 2005-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4654642 | 2005-03-08 | Paper |
| Patterns in words and languages | 2005-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737900 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737922 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738292 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453464 | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437504 | 2003-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4432976 | 2003-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4430289 | 2003-10-20 | Paper |
| Periodicity vectors for labelled trees | 2003-03-09 | Paper |
| On Fine and Wilf's theorem for bidimensional words. | 2003-01-22 | Paper |
| On the lattice of prefix codes. | 2003-01-21 | Paper |
| Forbidden Factors and Fragment Assembly | 2002-09-18 | Paper |
| Words and forbidden factors | 2002-07-15 | Paper |
| Recurrence and periodicity in infinite words from local periods | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2770686 | 2002-02-13 | Paper |
| Codes and equations on trees | 2001-08-20 | Paper |
| Forbidden words in symbolic dynamics | 2000-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503946 | 2000-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942615 | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941173 | 2000-02-29 | Paper |
| Fine and Wilf's theorem for three periods and a generalization of Sturmian words | 1999-06-21 | Paper |
| On some factorization problems | 1999-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4227127 | 1999-02-23 | Paper |
| Periodicities on trees | 1999-01-12 | Paper |
| Periodicity and the golden ratio | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218144 | 1998-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375815 | 1998-02-08 | Paper |
| ON LANGUAGES FACTORIZING THE FREE MONOID | 1997-03-31 | Paper |
| Monadic second-order logic over rectangular pictures and recognizability by tiling systems | 1996-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858461 | 1996-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4874662 | 1996-04-28 | Paper |
| ON THE STAR HEIGHT OF RATIONAL LANGUAGES | 1994-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035659 | 1993-05-18 | Paper |
| Star-free trace languages | 1992-09-27 | Paper |
| A note on renewal systems | 1992-09-26 | Paper |
| Codes and local constraints | 1990-01-01 | Paper |
| Complete subgraphs of bipartite graphs and applications to trace languages | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3495038 | 1990-01-01 | Paper |
| Completing codes | 1989-01-01 | Paper |
| A note on multiset decipherable codes | 1989-01-01 | Paper |
| Permutation properties and the Fibonacci semigroup | 1989-01-01 | Paper |
| Finitely generated sofic systems | 1989-01-01 | Paper |
| Star-free sets of integers | 1986-01-01 | Paper |
| Rational languages and the Burnside problem | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3689370 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3700856 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3741097 | 1985-01-01 | Paper |
| A finiteness condition for finitely generated semigroups | 1984-01-01 | Paper |
| On the Burnside problem for semigroups | 1984-01-01 | Paper |
| On cancellation properties of languages which are supports of rational power series | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3700855 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3707424 | 1984-01-01 | Paper |
| On the centers of a language | 1983-01-01 | Paper |
| Some applications of a theorem of Shirshov to language theory | 1983-01-01 | Paper |
| A family of codes commutatively equivalent to prefix codes | 1981-01-01 | Paper |
| A synchronization property of pure subsemigroups of a free semigroup | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3665330 | 1981-01-01 | Paper |
| A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3899527 | 1980-01-01 | Paper |
| On some properties of very pure codes | 1980-01-01 | Paper |
| Minimal complete sets of words | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4198939 | 1979-01-01 | Paper |
| Synchronization and simplification | 1979-01-01 | Paper |
| Sur le théorème du defaut | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3931621 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4163681 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4147595 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4147596 | 1977-01-01 | Paper |
| On codes having no finite completions | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4171972 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4116077 | 1975-01-01 | Paper |
| A combinatorial property of codes having finite synchronization delay | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4112482 | 1974-01-01 | Paper |
| On a question of McNaughton and Papert | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4403738 | 1973-01-01 | Paper |
| On the mathematical description of quantized fields | 1970-01-01 | Paper |
