ONLINE AND DYNAMIC RECOGNITION OF SQUAREFREE STRINGS

DOI10.1142/S0129054107004747zbMATH Open1119.68176OpenAlexW1994277086MaRDI QIDQ3434282FDOQ3434282

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

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

zbMATH Keywords

online algorithmsquare detectionsquarefree string

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• An efficient algorithm for online square detection
• Title not available (Why is that?)
• 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)