On Maximal Parsings of Strings

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 Lempel-Ziv parsings can vary under reversal by a factor on the order of log of sequence length. We give two interpretations of maximal parsing, show that they are not equivalent and that one lacks a plausible monotonicity property