Testing square-freeness of strings compressed by balanced straight line program

Conferences in Research and Practice in Information Technology Series

Volumn 94, Issue , 2009, Pages

  Matsubara, Wataru ^a   Inenaga, Shunsuke ^b   Shinohara, Ayumi ^a  

^a TOHOKU UNIVERSITY   (Japan)

^b KYUSHU UNIVERSITY   (Japan)

Author keywords

Balanced straight line program; Repetitions; Squares; String algorithm; Text compression

Indexed keywords

REPETITIONS; SQUARES; STRAIGHT LINE PROGRAM; STRING ALGORITHMS; TEXT COMPRESSIONS;

ALGORITHMS; COMPUTATION THEORY;

SOFTWARE TESTING;

EID: 84859645349     PISSN: 14451336     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Apostolico, A. (1992), 'Optimal parallel detection of squares in strings', Algorithmica 8, 285-319.
2. Apostolico, A. & Breslauer, D. (1996), 'An optimal O(log logN)-time parallel algorithm for detecting all squares in a string', SIAM J. Comput. 25(6), 1318-1331.
3. Apostolico, A. & Preparata, F. P. (1983), 'Optimal off-line detection of repetitions in a string', Theoretical Computer Science 22, 297-315.
4. Crochemore, M. (1981), 'An optimal algorithm for computing the repetitions in a word', Information Processing Letters 12(5), 244-250.
5. Crochemore, M. (1986), 'Transducers and repetitions', Theoretical Computer Science 12, 63-86.
6. Crochemore, M. & Rytter, W. (1991), 'Efficient parallel algorithms to test square-freeness and factorize strings', Information Processing Letters 38(2), 57- 60.
7. Crochemore, M. & Rytter, W. (1995), 'Squares, cubes, and time-space efficient string searching', Algorithmica 13(5), 405-425.
8. Gasieniec, L., Karpinski, M., Plandowski, W. & Rytter, W. (1996), Efficient algorithms for Lempel-Ziv encoding, in 'Proc. 5th Scandinavian Workshop on Algorithm Theory (SWAT'96)', Vol. 1097 of Lecture Notes in Computer Science, Springer-Verlag, pp. 392-403.
9. Gusfield, D. (1997), Algorithms on Strings, Trees, and Sequences, Cambridge University Press.
10. Gusfield, D. & Stoye, J. (2004), 'Linear time algorithms for finding and representing all the tandem repeats in a string', J. Comput. Syst. Sci. 69(4), 525-546.
11. Harrison, M. (1978), Introduction to Formal Language Theory, Addison-Wesley.
12. Hirao, M., Shinohara, A., Takeda, M. & Arikawa, S. (2000), Faster fully compressed pattern matching algorithm for balanced straight-line programs, in 'Proc. 7th International Symp. on String Processing and Information Retrieval (SPIRE'00)', IEEE Computer Society, pp. 132-138.
13. Inenaga, S., Shinohara, A. & Takeda, M. (2004), An efficient pattern matching algorithm on a subclass of context free grammars, in 'Proc. Eighth International Conference on Developments in Language Theory (DLT'04)', Vol. 3340 of Lecture Notes in Computer Science, Springer-Verlag, pp. 225-236.
14. Karpinski, M., Rytter, W. & Shinohara, A. (1997), 'An efficient pattern-matching algorithm for strings with short descriptions', Nordic Journal of Computing 4, 172-186.
15. Kolpakov, R. M. & Kucherov, G. (1999), Finding maximal repetitions in a word in linear time, in 'Proc. 40th Annual Symposium on Foundations of Computer Science (FOCS'99)', pp. 596-604.
16. Lifshits, Y. (2007), Processing compressed texts: A tractability border, in 'Proc. 18th Annual Symposium on Combinatorial Pattern Matching (CPM'07)', Vol. 4580 of Lecture Notes in Computer Science, Springer-Verlag, pp. 228-240.
17. Lothaire, M. (1983), Combinatorics on Words, Addison-Wesley.
18. Main, M. G. & Lorentz, R. J. (1985), Linear time recognition of squarefree strings, in 'Combinatorial Algorithms on Words', Vol. F12 of NATO ASI Series, Springer, pp. 271-278.
19. Matsubara, W., Inenaga, S., Ishino, A., Shinohara, A., Nakamura, T. & Hashimoto, K. (2008), Computing longest common substring and all palindromes from compressed strings, in 'Proc. 34th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM' 08)', Vol. 4910 of Lecture Notes in Computer Science, Springer-Verlag, pp. 364-375.
20. Miyazaki, M., Shinohara, A. & Takeda, M. (1997), An improved pattern matching algorithm for strings in terms of straight-line programs, in 'Proc. 8th Annual Symposium on Combinatorial Pattern Matching (CPM'97)', Vol. 1264 of Lecture Notes in Computer Science, Springer-Verlag, pp. 1-11.
21. Thue, A. (1906), 'Über unendliche Zeichenreihen', Norske Vid Selsk. Skr. I Mat-Nat Kl. (Christiana) 7, 1-22.
22. Thue, A. (1912), 'Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen', Norske Vid Selsk. Skr. I Mat-Nat Kl. (Christiana) 1, 1-67.