Counting maximal-exponent factors in words
From MaRDI portal
Publication:728262
DOI10.1016/J.TCS.2016.02.035zbMATH Open1370.68239OpenAlexW2288701678WikidataQ61677821 ScholiaQ61677821MaRDI QIDQ728262FDOQ728262
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
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 \(\beta\)-free binary words
- Rich square-free words
- The Ehrenfeucht-Silberger Problem
- scientific article; zbMATH DE number 7561424
- Publication:4934345
Cites Work
- Algorithms on Strings, Trees and Sequences
- Title not available (Why is that?)
- The ``runs conjecture
- A characterization of the squares in a Fibonacci string
- Algorithmic aspects of bioinformatics. Translated from the German original
- The number of runs in a string
- A faster algorithm for computing maximal \(\alpha \)-gapped repeats in a string
- A new characterization of maximal repetitions by Lyndon trees
- Computing maximal-exponent factors in an overlap-free word
- Longest Gapped Repeats and Palindromes
- Efficiently Finding All Maximal alpha-gapped Repeats
- Searching of Gapped Repeats and Subrepetitions in a Word
Cited In (6)
- Enumerating words with forbidden factors
- Multiple factorizations of words and defect effect
- Efficient representation and counting of antipower factors in words
- 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)
