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

DOI10.1016/0020-0190(84)90082-6MaRDI QIDQ800095zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On the product of square-free words
• scientific article; zbMATH DE number 3894492
• Partially abelian squarefree words
• Extremal square-free words
• A characterization of power-free morphisms

Cites work

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

Cited in

(3)

• Center and distinguisher for strings with unbounded alphabet
• Overlap-free words and finite automata
• Transition property for cube-free words

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800095)