Abstract.
The aim of this paper is twofold. We present first an overview of some of the current work on T-codes, a class of variable - length codes which exhibit strong self - synchronization properties but also provide an effective framework for describing and computing string complexity and information content. Secondly we present a number of underlying mathematical results, specifically the core uniqueness results presented in full in [6]. These establish the relationship between maximal-length strings and their respective T-code sets, as conjectured in [9] and reflected in empirical observations. These results underpin a new complexity measure, thereby laying the mathematical foundations for further developments in this area.