Ancestors graph and an upper bound for the subword complexity function

DOI10.1016/J.TCS.2012.11.014zbMath1295.68143OpenAlexW2070478159MaRDI QIDQ1935789

Delalleau Guillaume

Publication date: 19 February 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.11.014

zbMATH Keywords

Hilbert seriessubword complexity functionprimitive substitutionancestors graphnoncommutative polynomial ring

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

This page was built for publication: Ancestors graph and an upper bound for the subword complexity function