Growth of Power-Free Languages over Large Alphabets

DOI10.1007/978-3-642-13182-0_35zbMath1285.68091OpenAlexW1504191168MaRDI QIDQ3569760

Arseny M. Shur

Publication date: 22 June 2010

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13182-0_35

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Growth properties of power-free languages ⋮ Generating square-free words efficiently ⋮ Computing the maximum exponent in a stream

This page was built for publication: Growth of Power-Free Languages over Large Alphabets