-
AFE
-
Lehre
-
Algorithmische Grundlagen
Theses
parsed substring (or 0 if a never seen character is processed), and len is its length (or the newly-seen character). For example, the LZ parse of T = abaababaaabab is LZ(T) = (0,a)(0,b)(1,1)(1,3)(2,3)(4 [...] parsed substring (or 0 if a never seen character is processed), and len is its length (or the newly-seen character). For example, the LZ parse of T = abaababaaabab is LZ(T) = (0,a)(0,b)(1,1)(1,3)(2,3)(4 …