Abelian borders in binary words

DOI10.1016/j.dam.2014.02.012zbMath1311.68127WikidataQ61677844 ScholiaQ61677844MaRDI QIDQ2449116

Costas S. Iliopoulos, Manolis Christodoulakis, Maxime Crochemore, Michalis Christou

Publication date: 6 May 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.02.012

zbMATH Keywords

periods; binary words; abelian border; Dyck words; abelian border-free words; abelian words

Mathematics Subject Classification ID

68R15: Combinatorics on words

Related Items

Unnamed Item, Abelian combinatorics on words: a survey, Dyck Words, Lattice Paths, and Abelian Borders, Abelian bordered factors and periodicity, Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings, On highly palindromic words: the ternary case, Combinatorics on partial word borders, On a theorem concerning partially overlapping subpalindromes of a binary word, On highly palindromic words: the \(n\)-ary case, On the average number of regularities in a word

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS
• IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS
• Combinatorics of Compositions and Words
• On the Number of Abelian Bordered Words
• Abelian periods, partial words, and an extension of a theorem of Fine and Wilf