On Prefix/Suffix-Square Free Words

DOI10.1007/978-3-319-23826-5_6zbMath1380.68469OpenAlexW2235157643MaRDI QIDQ2949834

Dirk Nowotka, Florin Manea, Marius Dumitran

Publication date: 2 October 2015

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23826-5_6

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items

Prefix-suffix square reduction ⋮ Factorizing strings into repetitions ⋮ Longest property-preserved common factor: a new string-processing framework ⋮ On the Prefix–Suffix Duplication Reduction ⋮ On the size of overlapping Lempel-Ziv and Lyndon factorizations

Cites Work

• Unnamed Item
• Unnamed Item
• An optimal algorithm for computing the repetitions in a word
• Decomposable searching problems
• Detecting leftmost maximal periodicities
• Prefix-suffix duplication
• Testing Generalised Freeness of Words
• Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
• Linear work suffix array construction
• A Minimal Periods Algorithm with Applications
• Algorithms on Strings, Trees and Sequences
• Mathematical Foundations of Computer Science 2003