22 citations · 22 across the 2 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2019
Pseudo-solutions of word equations
Štěpán Holub
We present a framework which allows a uniform approach to the recently introduced concept of pseudo-repetitions on words in the morphic case. This framework is at the same time mor…
cs.FL2019
Maximal State Complexity and Generalized de Bruijn Words
Daniel Gabric, Štěpán Holub, Jeffrey Shallit
We compute the exact maximum state complexity for the language consisting of words of length , and characterize languages achieving the maximum. We also consider a special c…
cs.FL2012★ 22 cited
Binary equality sets are generated by two words
Štěpán Holub
We show that the equality language of two non-periodic binary morphisms is generated by at most two words. If its rank is two, then the generators start (and end) with different le…