Counting maximal-exponent factors in words

DOI10.1016/J.TCS.2016.02.035MaRDI QIDQ728262zbMATH OpenOpenAlexWikidataFDO

Authors Golnaz Badkobeh, Maxime Crochemore, Robert Mercaş

Publication date 19 December 2016

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2016.02.035

zbMATH Keywords

combinatorics on wordsmaximal-exponent factorword exponent

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Computing maximal-exponent factors in an overlap-free word
• On Dejean's conjecture over large alphabets
• On the Repetition Threshold for Large Alphabets
• Fewest repetitions versus maximal-exponent powers in infinite binary words
• Extremal square-free words
• Extremal overlap-free and extremal -free binary words
• Rich square-free words
• The Ehrenfeucht-Silberger Problem
• Longest unbordered factor in quasilinear time
• Publication:4934345

Cites work

• scientific article; zbMATH DE number 2185638 (Why is no real title available?)
• A characterization of the squares in a Fibonacci string
• A faster algorithm for computing maximal \(\alpha \)-gapped repeats in a string
• A new characterization of maximal repetitions by Lyndon trees
• Algorithmic aspects of bioinformatics. Translated from the German original
• Algorithms on Strings, Trees and Sequences
• Computing maximal-exponent factors in an overlap-free word
• Efficiently finding all maximal \(\alpha\)-gapped repeats
• Searching of Gapped Repeats and Subrepetitions in a Word
• The ``runs conjecture
• The number of runs in a string

Cited in

(5)

• Enumerating words with forbidden factors
• Multiple factorizations of words and defect effect
• Factorizing words over an ordered alphabet
• A characterization of the words occurring as factors in a minimum number of words
• Computing maximal-exponent factors in an overlap-free word

This page was built for publication: Counting maximal-exponent factors in words

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