Title :
On maximal parsings of strings
Author :
Helfgott, Harald ; Cohn, Martin
Author_Institution :
Dept. of Comput. Sci., Brandeis Univ., Waltham, MA, USA
Abstract :
Given a sequence, we consider the maximum number of distinct phrases in any parsing; this definition of complexity is invariant under string reversal. We show that the Lempel-Ziv (1976, 1978) parsings can vary under reversal by a factor on the order of the log of the sequence length. We give two interpretations of maximal parsing, show that they are not equivalent and that one lacks a plausible monotonicity property
Keywords :
binary sequences; computational complexity; Lempel-Ziv parsings; binary sequences; complexity; maximal parsings; sequence length; string reversal; strings; Binary sequences; Computer science; Length measurement; Performance evaluation;
Conference_Titel :
Data Compression Conference, 1997. DCC '97. Proceedings
Conference_Location :
Snowbird, UT
Print_ISBN :
0-8186-7761-9
DOI :
10.1109/DCC.1997.582052
