| Publication | Date of Publication | Type |
|---|
ON GENERALIZED SLENDERNESS OF CONTEXT-FREE LANGUAGES
Words, Semigroups, and Transductions | 2022-12-06 | Paper |
On a geometric problem of zigzags.
Information Processing Letters | 2016-05-26 | Paper |
A comparison of index-based Lempel-Ziv LZ77 factorization algorithms
ACM Computing Surveys | 2014-08-13 | Paper |
| Understanding maximal repetitions in strings | 2013-03-19 | Paper |
Understanding maximal repetitions in strings
(available as arXiv preprint) | 2013-03-19 | Paper |
Computing the longest previous factor
European Journal of Combinatorics | 2012-11-15 | Paper |
Minimum unique substrings and maximum repeats
Fundamenta Informaticae | 2011-11-22 | Paper |
The ``runs'' conjecture
Theoretical Computer Science | 2011-06-16 | Paper |
The longest common extension problem revisited and applications to approximate string searching
Journal of Discrete Algorithms | 2011-01-20 | Paper |
Computing longest previous factor in linear time and applications
Information Processing Letters | 2010-04-19 | Paper |
Periodic and Sturmian languages
Information Processing Letters | 2010-01-18 | Paper |
LPF computation revisited
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Repetitions in strings: algorithms and combinatorics
Theoretical Computer Science | 2009-11-06 | Paper |
| scientific article; zbMATH DE number 5605094 (Why is no real title available?) | 2009-09-19 | Paper |
Analysis of Maximal Repetitions in Strings
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Maximal repetitions in strings
Journal of Computer and System Sciences | 2008-06-26 | Paper |
Towards a Solution to the “Runs” Conjecture
Combinatorial Pattern Matching | 2008-06-17 | Paper |
The Lempel–Ziv Complexity of Fixed Points of Morphisms
SIAM Journal on Discrete Mathematics | 2008-05-22 | Paper |
THE STRUCTURE OF FACTOR ORACLES
International Journal of Foundations of Computer Science | 2008-05-20 | Paper |
Viral Genome Compression
DNA Computing | 2008-04-04 | Paper |
Gene Assembly Algorithms for Ciliates
DNA Computing | 2008-04-04 | Paper |
Factor Oracles
Implementation and Application of Automata | 2007-09-06 | Paper |
The Lempel-Ziv Complexity of Fixed Points of Morphisms
Lecture Notes in Computer Science | 2007-09-05 | Paper |
A note on the number of squares in a word
Theoretical Computer Science | 2007-07-16 | Paper |
| scientific article; zbMATH DE number 5074400 (Why is no real title available?) | 2006-11-21 | Paper |
| On disjunctivity, ultimate periodicity and ultimate identity of Păun-Salomaa self-reading sequences | 2006-09-06 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
A generalization of repetition threshold
Theoretical Computer Science | 2005-12-06 | Paper |
WORD COMPLEXITY AND REPETITIONS IN WORDS
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
Journal of Combinatorial Theory. Series A | 2005-10-17 | Paper |
A generalization of repetition threshold
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Generalised fine and Wilf's theorem for arbitrary number of periods
Theoretical Computer Science | 2005-06-30 | Paper |
| scientific article; zbMATH DE number 2182423 (Why is no real title available?) | 2005-06-23 | Paper |
Theory Is Forever
Lecture Notes in Computer Science | 2005-01-18 | Paper |
| scientific article; zbMATH DE number 2089987 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2087060 (Why is no real title available?) | 2004-08-11 | Paper |
Follow automata.
Information and Computation | 2004-03-14 | Paper |
Reducing NFAs by invariant equivalences.
Theoretical Computer Science | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 2050953 (Why is no real title available?) | 2004-03-07 | Paper |
| scientific article; zbMATH DE number 2051151 (Why is no real title available?) | 2004-03-07 | Paper |
| scientific article; zbMATH DE number 1962812 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1929949 (Why is no real title available?) | 2003-06-18 | Paper |
| scientific article; zbMATH DE number 1836429 (Why is no real title available?) | 2002-11-27 | Paper |
An attempt to define a class of mildly context-sensitive languages
Publicationes Mathematicae Debrecen | 2002-02-13 | Paper |
Two-variable word equations
RAIRO. Theoretical Informatics and Applications | 2001-07-23 | Paper |
Two-variable word equations
RAIRO. Theoretical Informatics and Applications | 2001-07-23 | Paper |
A characterization of poly-slender context-free languages
RAIRO - Theoretical Informatics and Applications | 2001-02-06 | Paper |
A characterization of poly-slender context-free languages
RAIRO - Theoretical Informatics and Applications | 2001-02-06 | Paper |
| scientific article; zbMATH DE number 1406007 (Why is no real title available?) | 2000-11-22 | Paper |
| scientific article; zbMATH DE number 1500512 (Why is no real title available?) | 2000-09-04 | Paper |
On lengths of words in context-free languages
Theoretical Computer Science | 2000-08-21 | Paper |
On strongly context-free languages
Discrete Applied Mathematics | 2000-07-11 | Paper |
2-testability and relabelings produce everything
Journal of Computer and System Sciences | 2000-05-18 | Paper |
Periods and binary words
Journal of Combinatorial Theory. Series A | 2000-05-11 | Paper |
On the expressiveness of subset-sum representations
Acta Informatica | 2000-05-09 | Paper |
| scientific article; zbMATH DE number 1339964 (Why is no real title available?) | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 1311365 (Why is no real title available?) | 1999-06-29 | Paper |
| scientific article; zbMATH DE number 1244205 (Why is no real title available?) | 1999-01-24 | Paper |
On quasi orders of words and the confluence property
Theoretical Computer Science | 1999-01-20 | Paper |
On well quasi orders of free monoids
Theoretical Computer Science | 1999-01-12 | Paper |
Languages obtained from infinite words
RAIRO - Theoretical Informatics and Applications | 1999-01-11 | Paper |
| scientific article; zbMATH DE number 1183242 (Why is no real title available?) | 1998-11-26 | Paper |
On computational complexity of contextual languages
Theoretical Computer Science | 1998-07-22 | Paper |
| scientific article; zbMATH DE number 1064117 (Why is no real title available?) | 1997-11-20 | Paper |
| scientific article; zbMATH DE number 1067866 (Why is no real title available?) | 1997-09-29 | Paper |
Binary self-adding sequences and languages<sup>1</sup>
International Journal of Computer Mathematics | 1997-02-13 | Paper |
| scientific article; zbMATH DE number 907952 (Why is no real title available?) | 1996-07-23 | Paper |
On subwords of infinite words
Discrete Applied Mathematics | 1996-07-07 | Paper |
On a conjecture about slender context-free languages
Theoretical Computer Science | 1994-09-25 | Paper |
