Gunther, Ulrich2009-04-162009-04-162001-02CDMTCS Research Reports CDMTCS-149 (2001)1178-3540http://hdl.handle.net/2292/3657This 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.https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htmTechnical ReportFields of Research::280000 Information, Computing and Communication SciencesThe author(s)http://purl.org/eprint/accessRights/OpenAccess