ONLINE AND DYNAMIC RECOGNITION OF SQUAREFREE STRINGS

DOI10.1142/S0129054107004747zbMath1119.68176OpenAlexW1994277086MaRDI QIDQ3434282

Jesper Jansson, Zeshan Peng

Publication date: 25 April 2007

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054107004747

zbMATH Keywords

online algorithmsquare detectionsquarefree string

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Pattern recognition, speech recognition (68T10)

Related Items

An efficient algorithm to test square-freeness of strings compressed by straight-line programs ⋮ Detecting regularities on grammar-compressed strings

Cites Work

• An optimal algorithm for computing the repetitions in a word
• Optimal off-line detection of repetitions in a string
• Transducers and repetitions
• An O(n log n) algorithm for finding all repetitions in a string
• Algorithms on Strings, Trees and Sequences
• On the sorting-complexity of suffix tree construction

This page was built for publication: ONLINE AND DYNAMIC RECOGNITION OF SQUAREFREE STRINGS