On the centers of the set of weakly square-free words on a two letter alphabet

DOI10.1016/0020-0190(84)90082-6zbMath0549.68073OpenAlexW1988786215MaRDI QIDQ800095

Arturo Carpi

Publication date: 1984

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90082-6

zbMATH Keywords

centerssquare-free wordspower-freeness

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Transition property for cube-free words ⋮ Overlap-free words and finite automata

Cites Work

• On the centers of a language
• Avoidable patterns in strings of symbols
• Uniformly growing k-th power-free homomorphisms
• Unending chess, symbolic dynamics and a problem in semi-groups

This page was built for publication: On the centers of the set of weakly square-free words on a two letter alphabet