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

研究成果: Contribution to journalArticle査読

4 被引用数 (Scopus)

抄録

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].

本文言語英語
ページ(範囲)711-714
ページ数4
ジャーナルInformation Processing Letters
112
19
DOI
出版ステータス出版済み - 10 15 2012

All Science Journal Classification (ASJC) codes

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

フィンガープリント 「An efficient algorithm to test square-freeness of strings compressed by straight-line programs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル