An efficient algorithm to test square-freeness of strings compressed by straight-line programs
type: Item
instance of: scholarly article
title: An efficient algorithm to test square-freeness of strings compressed by straight-line programs
zbMATH Open document ID: 1248.68575
author: Hideo Bannai
author: Travis Gagie
author: Shunsuke Inenaga
author: Gad M. Landau
author: Moshe Lewenstein
author: Tomohiro I
published in: Information Processing Letters
publication date: 2012-10-23T00:00:00Z
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 68P30
zbMATH DE Number: 6098072
zbMATH Keywords: string algorithms
zbMATH Keywords: string processing
zbMATH Keywords: repetitions in strings
zbMATH Keywords: text compression
zbMATH Keywords: straight-line programs
MaRDI profile type: Publication
full work available at URL: j.ipl.2012.06.017
OpenAlex ID: W1981704228
cites work: An Optimal $O(\log \log N)$-Time Parallel Algorithm for Detecting all Squares in a String
cites work: Transducers and repetitions
cites work: Efficient algorithms for Lempel-Ziv encoding
cites work: ONLINE AND DYNAMIC RECOGNITION OF SQUAREFREE STRINGS
cites work: Processing Compressed Texts: A Tractability Border
cites work: An O(n log n) algorithm for finding all repetitions in a string
cites work: Q3690246
cites work: Efficient algorithms to compute compressed longest common substrings and compressed palindromes
cites work: Q5414581
cites work: Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
DOI: 10.1016/J.IPL.2012.06.017
description: scientific article; zbMATH DE number 6098072