A combinatorial theorem on $p$-power-free words and an application to semigroups

DOI10.1051/ita/1990240302051zbMath0701.68065OpenAlexW192293500MaRDI QIDQ3479530

Stefano Varricchio, Aldo De Luca

Publication date: 1990

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92356

zbMATH Keywords

subword complexityinfinite words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05)

Related Items (6)

Pentagonal chains and annuli as models for designing nanostructures from cages ⋮ Factorial languages whose growth function is quadratically upper bounded ⋮ Stefano Varricchio (1960-2008) ⋮ Infinite words with linear subword complexity ⋮ On the combinatorics of finite words ⋮ The exact number of squares in Fibonacci words

Cites Work

• Unnamed Item
• On the Burnside problem for semigroups
• On the subword complexity of DOL languages with a constant distribution
• Permutation properties and the Fibonacci semigroup
• Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
• On the subword complexity of square-free DOL languages
• On the factors of the Thue-Morse word on three symbols
• On cube-free \(\omega\)-words generated by binary morphisms

This page was built for publication: A combinatorial theorem on $p$-power-free words and an application to semigroups