Thorough numerical entropy analysis of some substitutive sequences by lumping

Abstract

In this work we perform a detailed entropy analysis of some substitutive sequences using the technique of lumping. The basic novelty of the entropy analysis by lumping is that, unlike the Fourier transform or the conventional entropy analysis by gliding, it gives results that can be related to algorithmic aspects of the sequences and in particular with the important property of automaticity. All computations in this paper have been performed with TOOLS FOR SYMBOLIC DYNAMICS a Maple package developed by the authors.

Citation

Karamanos, K. and Kotsireas, I. (2002), "Thorough numerical entropy analysis of some substitutive sequences by lumping", Kybernetes, Vol. 31 No. 9/10, pp. 1409-1417. https://doi.org/10.1108/03684920210443617