The Maximal Subword Complexity of Quasiperiodic Infinite Words

zbMath1455.68155arXiv1008.1659MaRDI QIDQ4964023

Ludwig Staiger, Ronny Polley

Publication date: 24 February 2021

Full work available at URL: https://arxiv.org/abs/1008.1659

zbMATH Keywords

structure-generating functionquasiperiodic wordscodes, subword complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (2)

Coverability and multi-scale coverability on infinite pictures ⋮ Coverability in Two Dimensions

This page was built for publication: The Maximal Subword Complexity of Quasiperiodic Infinite Words