22 citations · 75 across the 21 of their papers we have counts for
Showing 2019Show all
2 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…