Efficient computation of maximal anti-exponent in palindrome-free strings

DOI10.1016/j.tcs.2016.02.014zbMath1356.68164OpenAlexW2287565596WikidataQ61677827 ScholiaQ61677827MaRDI QIDQ507406

Chalita Toopsuwan, Golnaz Badkobeh, Manal Mohamed, Maxime Crochemore

Publication date: 6 February 2017

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

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

zbMATH Keywords

palindromesLZ-factorisationsuffix automaton

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Last cases of Dejean's conjecture
• Computing maximal-exponent factors in an overlap-free word
• Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
• Sur un théorème de Thue
• A proof of Dejean’s conjecture
• Searching for Gapped Palindromes
• A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
• Fast Pattern Matching in Strings
• Algorithms on Strings, Trees and Sequences
• Algorithms on Strings

This page was built for publication: Efficient computation of maximal anti-exponent in palindrome-free strings