Weak abelian periodicity of infinite words

DOI10.1007/s00224-015-9629-1zbMath1354.68212arXiv1302.4359OpenAlexW1549546301MaRDI QIDQ504987

Svetlana Puzynina, Sergei V. Avgustinovich

Publication date: 18 January 2017

Published in: Theory of Computing Systems, Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.4359

zbMATH Keywords

infinite wordsubshiftsabelian equivalencefixed points of morphismsletter frequencyweak abelian periodicity

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (3)

Abelian combinatorics on words: a survey ⋮ Abelian closures of infinite binary words ⋮ On \(k\)-abelian palindromes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On certain sequences of lattice points
• Toeplitz words, generalized periodicity and periodically iterated morphisms
• A characterization of substitutive sequences using return words
• Balances for fixed points of primitive substitutions.
• A note on efficient computation of all abelian periods in a string
• On abelian versions of critical factorization theorem
• On Abelian repetition threshold
• Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries
• AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
• Abelian complexity of minimal subshifts
• Geometric realizations of substitutions
• IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS
• Abelian squares are avoidable on 4 letters
• Abelian returns in Sturmian words

This page was built for publication: Weak abelian periodicity of infinite words