ONLINE AND DYNAMIC RECOGNITION OF SQUAREFREE STRINGS

DOI10.1142/S0129054107004747MaRDI QIDQ3434282zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Mathematical Foundations of Computer Science 2005
• Combinatorial Pattern Matching
• scientific article; zbMATH DE number 3913712
• An efficient algorithm for online square detection
• Computing and Combinatorics

Cites work

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

Cited in

(8)

• An efficient algorithm for online square detection
• scientific article; zbMATH DE number 3913712 (Why is no real title available?)
• Combinatorial Pattern Matching
• Detecting regularities on grammar-compressed strings
• An efficient algorithm to test square-freeness of strings compressed by straight-line programs
• Computing and Combinatorics
• Mathematical Foundations of Computer Science 2005
• An efficient algorithm to test square-freeness of strings compressed by balanced straight line programs

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

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