An efficient algorithm to test square-freeness of strings compressed by straight-line programs

Hideo Bannai, Travis Gagie, Tomohiro I, Shunsuke Inenaga, Gad M. Landau, Moshe Lewenstein

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

Abstract

We give a simple algorithm that, given a straight-line program of size n for a string S of length N, tests whether S is square-free in O(n 4logN) time and O(n2) space. The algorithm also allows us to test square-freeness on an arbitrary composition system of size c for S, in O(c4log5N) time and O(c2log2N) space, which is faster than using the algorithm by Ga̧sieniec, Karpinski, Plandowski, and Rytter (1996) [4].

Original languageEnglish
Pages (from-to)711-714
Number of pages4
JournalInformation Processing Letters
Volume112
Issue number19
DOIs
Publication statusPublished - Oct 15 2012

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Fingerprint Dive into the research topics of 'An efficient algorithm to test square-freeness of strings compressed by straight-line programs'. Together they form a unique fingerprint.

Cite this