1 research outputs found
On the subword complexity of the fixed point of , , and generalizations
We find an explicit closed form for the subword complexity of the infinite
fixed point of the morphism sending and .
This morphism is then generalized in three different ways, and we find similar
explicit expressions for the subword complexity of the generalizations