On the Asymptotic Abelian Complexity of Morphic Words

DOI10.1007/978-3-642-38771-5_10zbMath1381.68228OpenAlexW10327095MaRDI QIDQ5300832

Nathan Fox, Francine Blanchet-Sadri

Publication date: 28 June 2013

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38771-5_10

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (3)

Fast algorithms for abelian periods in words and greatest common divisor queries ⋮ Cyclic Complexity of Words ⋮ On the asymptotic abelian complexity of morphic words

This page was built for publication: On the Asymptotic Abelian Complexity of Morphic Words