| Publication | Date of Publication | Type |
|---|
A connection between unbordered partial words and sparse rulers
The Electronic Journal of Combinatorics | 2026-03-20 | Paper |
| Hardness results for constant-free pattern languages and word equations | 2026-03-18 | Paper |
| Mapped exponent and asymptotic critical exponent of words | 2026-02-10 | Paper |
On the solution sets of three-variable word equations
Theory of Computing Systems | 2025-01-13 | Paper |
On the Solution Sets of Entire Systems of Word Equations
Lecture Notes in Computer Science | 2023-07-25 | Paper |
An optimal bound on the solution sets of one-variable word equations and its consequences
SIAM Journal on Computing | 2022-02-08 | Paper |
Separating the words of a language by counting factors
Fundamenta Informaticae | 2021-10-25 | Paper |
| An optimal bound on the solution sets of one-variable word equations and its consequences | 2021-07-28 | Paper |
Standard words and solutions of the word equation \(X_1^2\cdots X_n^2=(X_1\cdots X_n)^2\)
Journal of Combinatorial Theory. Series A | 2021-02-02 | Paper |
| Independent systems of word equations: from Ehrenfeucht to eighteen | 2019-11-06 | Paper |
Separating many words by counting occurrences of factors
(available as arXiv preprint) | 2019-10-15 | Paper |
On abelian saturated infinite words
Theoretical Computer Science | 2019-10-07 | Paper |
Word equations with \(k\)th powers of variables
Journal of Combinatorial Theory. Series A | 2019-06-25 | Paper |
Systems of word equations, polynomials and linear algebra: a new approach
European Journal of Combinatorics | 2018-12-06 | Paper |
Studying word equations by a method of weighted frequencies
Fundamenta Informaticae | 2018-10-02 | Paper |
One-variable word equations and three-variable constant-free word equations
International Journal of Foundations of Computer Science | 2018-09-20 | Paper |
Degrees of infinite words, polynomials and atoms
International Journal of Foundations of Computer Science | 2018-09-20 | Paper |
| Word equations where a power equals a product of powers | 2018-04-19 | Paper |
| Palindromic length in free monoids and free groups | 2017-11-15 | Paper |
On growth and fluctuation of \(k\)-abelian complexity
European Journal of Combinatorics | 2017-08-31 | Paper |
Variations of the Morse-Hedlund theorem for \(k\)-abelian equivalence
Acta Cybernetica | 2017-08-25 | Paper |
Equivalence relations defined by numbers of occurrences of factors
Fundamenta Informaticae | 2017-07-28 | Paper |
Degrees of Infinite Words, Polynomials and Atoms
Developments in Language Theory | 2016-08-30 | Paper |
One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations
Developments in Language Theory | 2016-08-30 | Paper |
Systems of word equations and polynomials: a new approach
Electronic Proceedings in Theoretical Computer Science | 2016-03-01 | Paper |
Systems of word equations and polynomials: a new approach
Electronic Proceedings in Theoretical Computer Science | 2016-03-01 | Paper |
Degrees of transducibility
Lecture Notes in Computer Science | 2015-11-04 | Paper |
On growth and fluctuation of \(k\)-abelian complexity
Lecture Notes in Computer Science | 2015-10-20 | Paper |
5-abelian cubes are avoidable on binary alphabets
RAIRO - Theoretical Informatics and Applications | 2014-12-12 | Paper |
Variations of the Morse-Hedlund theorem for \(k\)-abelian equivalence
Developments in Language Theory | 2014-10-14 | Paper |
Fine and Wilf's theorem for \(k\)-abelian periods
International Journal of Foundations of Computer Science | 2014-08-04 | Paper |
On maximal chains of systems of word equations
Proceedings of the Steklov Institute of Mathematics | 2014-08-04 | Paper |
| Noneffective regularity of equality languages and bounded delay morphisms | 2014-05-06 | Paper |
On a generalization of abelian equivalence and complexity of infinite words
Journal of Combinatorial Theory. Series A | 2014-01-06 | Paper |
Strongly \(k\)-abelian repetitions
Lecture Notes in Computer Science | 2013-09-20 | Paper |
Weakly Unambiguous Morphisms with Respect to Sets of Patterns with Constants
Lecture Notes in Computer Science | 2013-09-20 | Paper |
3-abelian cubes are avoidable on binary alphabets
Developments in Language Theory | 2013-06-28 | Paper |
Fine and Wilf's theorem for \(k\)-abelian periods
Developments in Language Theory | 2012-11-02 | Paper |
Problems in between words and abelian words: \(k\)-abelian avoidability
Theoretical Computer Science | 2012-10-11 | Paper |
The Unique Decipherability in the Monoid of Regular Languages is Undecidable
Fundamenta Informaticae | 2011-11-22 | Paper |
Unique decipherability in the additive monoid of sets of numbers
RAIRO - Theoretical Informatics and Applications | 2011-08-10 | Paper |
Unique decipherability in the additive monoid of sets of numbers
RAIRO - Theoretical Informatics and Applications | 2011-08-10 | Paper |
Local squares, periodicity and finite automata
Lecture Notes in Computer Science | 2011-05-27 | Paper |
| Ultimately constant abelian complexity of infinite words | 2010-09-20 | Paper |
On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations
Developments in Language Theory | 2009-07-07 | Paper |
An Analysis and a Reproof of Hmelevskii’s Theorem
Developments in Language Theory | 2008-10-30 | Paper |
