On the subword complexity of iteratively generated infinite words.

DOI10.1016/S0166-218X(00)00364-4zbMath1161.68705OpenAlexW2040384023MaRDI QIDQ5954086

Anna E. Frid

Publication date: 30 January 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00364-4

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Automata sequences (11B85)

Related Items (1)

On the context-freeness of the set of words containing overlaps

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the subword complexity of iteratively generated infinite words.