FINE AND WILF'S THEOREM FOR k-ABELIAN PERIODS

DOI10.1142/S0129054113400352zbMath1293.68210MaRDI QIDQ5495424

Juhani Karhumäki, Aleksi Saarela, Svetlana Puzynina

Publication date: 4 August 2014

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

periodicitycombinatorics on words\(k\)-abelian equivalenceFine and Wilf's theorem

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Related Items (7)

Abelian combinatorics on words: a survey ⋮ A compactness property of the \(k\)-abelian monoids ⋮ Relations on words ⋮ On \(k\)-abelian palindromes ⋮ On cardinalities of \(k\)-abelian equivalence classes ⋮ k-Abelian Equivalence and Rationality ⋮ A periodicity lemma for partial words

Cites Work

• Problems in between words and abelian words: \(k\)-abelian avoidability
• Fine and Wilf's theorem for three periods and a generalization of Sturmian words
• Partial words and a theorem of Fine and Wilf
• Periodicity on partial words
• Fine and Wilf words for any periods. II

This page was built for publication: FINE AND WILF'S THEOREM FOR k-ABELIAN PERIODS