| Publication | Date of Publication | Type |
|---|
Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time
International Journal of Foundations of Computer Science | 2024-02-16 | Paper |
Binary codes that do not preserve primitivity
Journal of Automated Reasoning | 2023-08-04 | Paper |
| Formalization of Basic Combinatorics on Words | 2023-06-20 | Paper |
Binary codes that do not preserve primitivity
(available as arXiv preprint) | 2022-12-07 | Paper |
| Lyndon words formalized in Isabelle/HOL | 2022-03-25 | Paper |
Maximal state complexity and generalized de Bruijn words
Information and Computation | 2022-03-14 | Paper |
The intersection of 3-maximal submonoids
Theoretical Computer Science | 2022-01-18 | Paper |
Binary intersection formalized
Theoretical Computer Science | 2021-04-14 | Paper |
The Intersection of 3-Maximal Submonids
(available as arXiv preprint) | 2020-08-04 | Paper |
| Generalized de Bruijn words and the state complexity of conjugate sets | 2020-05-12 | Paper |
Pseudo-solutions of word equations
Theoretical Computer Science | 2020-03-12 | Paper |
| Binary intersection revisited | 2019-11-06 | Paper |
On the height of towers of subsequences and prefixes
Information and Computation | 2019-09-17 | Paper |
Maximal State Complexity and Generalized de Bruijn Words
(available as arXiv preprint) | 2019-03-13 | Paper |
Binary equality words with two \(b\)'s.
Commentationes Mathematicae Universitatis Carolinae | 2018-09-20 | Paper |
Periods and borders of random words
(available as arXiv preprint) | 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
Theoretical Computer Science | 2017-06-15 | Paper |
Fully bordered words
Theoretical Computer Science | 2017-06-15 | Paper |
A presentation of a finitely generated submonoid of invertible endomorphisms of the free monoid
Semigroup Forum | 2017-02-24 | Paper |
Equation $$x^iy^jx^k=u^iv^ju^k$$ in Words
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Algebraic properties of word equations
Journal of Algebra | 2015-05-06 | Paper |
Words with unbounded periodicity complexity
International Journal of Algebra and Computation | 2014-12-12 | Paper |
On upper and lower bounds on the length of alternating towers
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Universal Lyndon words
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
| Complexity of testing morphic primitivity | 2013-06-14 | Paper |
Complexity of testing morphic primitivity
(available as arXiv preprint) | 2013-06-14 | Paper |
Large simple binary equality words
International Journal of Foundations of Computer Science | 2013-06-06 | Paper |
Abelian powers in paper-folding words
Journal of Combinatorial Theory. Series A | 2013-04-15 | Paper |
| On an algorithm for multiperiodic words | 2012-12-29 | Paper |
Corrigendum: on multiperiodic words
RAIRO - Theoretical Informatics and Applications | 2012-02-28 | Paper |
The Ehrenfeucht-Silberger problem
Journal of Combinatorial Theory. Series A | 2012-02-11 | Paper |
ON PARTITIONS SEPARATING WORDS
International Journal of Algebra and Computation | 2012-01-16 | Paper |
Binary morphisms with stable suffix complexity
International Journal of Foundations of Computer Science | 2011-05-10 | Paper |
Reduction tree of the binary generalized post correspondence problem
International Journal of Foundations of Computer Science | 2011-03-30 | Paper |
On the relation between periodicity and unbordered factors of finite words
International Journal of Foundations of Computer Science | 2010-09-06 | Paper |
Intricacies of simple word equations: an example
International Journal of Foundations of Computer Science | 2010-01-29 | Paper |
Polynomial-time algorithm for fixed points of nontrivial morphisms
Discrete Mathematics | 2009-12-15 | Paper |
The Ehrenfeucht-Silberger Problem
Automata, Languages and Programming | 2009-07-14 | Paper |
On highly palindromic words
Discrete Applied Mathematics | 2009-06-30 | Paper |
On the Relation between Periodicity and Unbordered Factors of Finite Words
Developments in Language Theory | 2008-10-30 | Paper |
Large Simple Binary Equality Words
Developments in Language Theory | 2008-10-30 | Paper |
Parikh test sets for commutative languages
RAIRO - Theoretical Informatics and Applications | 2008-09-25 | Paper |
On systems of word equations with simple loop sets
Theoretical Computer Science | 2007-07-16 | Paper |
On multiperiodic words
RAIRO - Theoretical Informatics and Applications | 2007-02-20 | Paper |
On multiperiodic words
RAIRO - Theoretical Informatics and Applications | 2007-02-20 | Paper |
A proof of the extended Duval's conjecture
Theoretical Computer Science | 2005-06-30 | Paper |
| scientific article; zbMATH DE number 2051183 (Why is no real title available?) | 2004-03-07 | Paper |
| scientific article; zbMATH DE number 1948502 (Why is no real title available?) | 2003-07-13 | Paper |
Binary equality sets are generated by two words
Journal of Algebra | 2003-04-02 | Paper |
Linear size test sets for certain commutative languages
RAIRO - Theoretical Informatics and Applications | 2002-09-24 | Paper |
Linear size test sets for certain commutative languages
RAIRO - Theoretical Informatics and Applications | 2002-09-24 | Paper |
Linear size test sets for certain commutative languages
RAIRO - Theoretical Informatics and Applications | 2002-09-24 | Paper |
Local and global cyclicity in free semigroups
Theoretical Computer Science | 2002-03-03 | Paper |
| In search of a word with special combinatorial properties | 2001-10-03 | Paper |
| scientific article; zbMATH DE number 1342157 (Why is no real title available?) | 1999-11-01 | Paper |
