Abstract
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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.