On the subword complexity of the fixed point of a → aab, b → b, and generalizations
Abstract
We find an explicit closed form for the subword complexity of the infinite fixed point of the morphism sending a → aab and b → b. This morphism is then generalized in three different ways, and we find similar explicit expressions for the subword complexity of the generalizations.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.