22 citations · 75 across the 21 of their papers we have counts for
4 papers · 1 filter
Alternating Towers and Piecewise Testable Separators
Štěpán Holub, Tomáš Masopust, Michaël Thomazo
Two languages are separable by a piecewise testable language if and only if there exists no infinite tower between them. An infinite tower is an infinite sequence of strings altern…
Universal Lyndon Words
Arturo Carpi, Gabriele Fici, Stepan Holub +2
A word over an alphabet is a Lyndon word if there exists an order defined on for which is lexicographically smaller than all of its conjugates (other than itself).…
On Upper and Lower Bounds on the Length of Alternating Towers
Štěpán Holub, Galina Jirásková, Tomáš Masopust
A tower between two regular languages is a sequence of strings such that all strings on odd positions belong to one of the languages, all strings on even positions belong to the ot…
Algebraic properties of word equations
Štěpán Holub, Jan Žemlička
The question about maximal size of independent system of word equations is one of the most striking problems in combinatorics on words. Recently, Aleksi Saarela has introduced a ne…