22 citations · 22 across the 2 of their papers we have counts for
1 paper · 1 filter
Š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…