On abelian versions of critical factorization theorem

DOI10.1051/ita/2011121zbMath1247.68200OpenAlexW2121592327MaRDI QIDQ2911422

Juhani Karhumäki, Svetlana Puzynina, Sergei V. Avgustinovich

Publication date: 31 August 2012

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

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

zbMATH Keywords

periodicitycombinatorics on wordsabelian properties of wordscentral factorization theorem

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

Abelian powers and repetitions in Sturmian words ⋮ Abelian Repetitions in Sturmian Words ⋮ Abelian combinatorics on words: a survey ⋮ Dyck Words, Lattice Paths, and Abelian Borders ⋮ Unnamed Item ⋮ Local Squares, Periodicity and Finite Automata ⋮ Abelian bordered factors and periodicity ⋮ Weak abelian periodicity of infinite words ⋮ On \(k\)-abelian palindromes ⋮ Aperiodic two-dimensional words of small abelian complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Everywhere \(\alpha \)-repetitive sequences and Sturmian words
• Periodes et repetitions des mots du monoide libre
• Periodicity and the golden ratio
• Toeplitz words, generalized periodicity and periodically iterated morphisms
• Locally periodic versus globally periodic infinite words
• AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
• Abelian complexity of minimal subshifts