22 citations · 75 across the 21 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
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…
cs.FL2012
Complexity of testing morphic primitivity
Vojtěch Matocha, Štěpán Holub
We analyze the algorithm in [Holub, 2009], which decides whether a given word is a fixed point of a nontrivial morphism. We show that it can be implemented to have complexity in O(…
cs.FL2012★ 6 cited
Abelian powers in paper-folding words
Štěpán Holub
We show that paper folding words contain arbitrarily large abelian powers.