Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
438948 | Theoretical Computer Science | 2011 | 7 Pages |
Abstract
Ziv–Lempel and Crochemore factorization are two kinds of factorizations of words related to text processing. In this paper, we find these factorizations for standard epiesturmian words. Thus the previously known c-factorization of characteristic Sturmian words is provided as a special case. Moreover, the two factorizations are compared.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics