Abstract:
This paper describes the derivation of the T-Complexity and T-Information
Theory from the decomposition of finite strings, based on the
duality of strings and variable-length T-Codes. It further outlines its similarity
to the string parsing algorithm by Lempel and Ziv. It is intended
as a summary of work published mainly by Titchener and Nicolescu.