Thorough numerical entropy analysis of some substitutive sequences by lumping-Reference-Cited by-同舟云学术

Thorough numerical entropy analysis of some substitutive sequences by lumping

Published:2002-12-01 Issue:9/10 Volume:31 Page:1409-1417
ISSN:0368-492X
Container-title:Kybernetes
language:en
Short-container-title:

Author:

Karamanos K.,Kotsireas I.

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.

Publisher

Emerald

Subject

Computer Science (miscellaneous),Social Sciences (miscellaneous),Theoretical Computer Science,Control and Systems Engineering,Engineering (miscellaneous)

Reference36 articles.

1. Allouche, J.‐P. (1994), “On the complexity of infinite sequences”, Bull. Belg. Math. Soc., Vol. 1 No. 2, pp. 133–43.

2. Allouche, J.‐P. (2000), “Algebraic and analytic randomness”, in Planat, M. (Ed.), Noise, Oscillators and Algebraic Randomness, Lecture Note in Physics, Springer, 550, pp. 345–56.

3. Allouche, J.‐P. and Mende`s France M. (1995), “Automata and automatic sequences”, in Axel, F. and Gratias, D. (Eds), Beyond quasicrystals, Les Houches, Les E´ditions de Physique, and references therein Springer, pp. 293–367.

4. Allouche, J.‐P. and Shallit, J. (1999), “The ubiquitous Prouhet‐Thue‐Morse sequence”, Sequences and their Applications, Springer Ser. Discrete Math. Theor. Comput. Sci., Springer, London, pp. 1–16.

5. Bai‐Lin, H. (1994), Chaos, World Scientific, Singapore.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Structure of the correlation function at the accumulation points of the logistic map;Chaos, Solitons & Fractals;2017-03

2. SYMBOL-TO-SYMBOL CORRELATION FUNCTION AT THE FEIGENBAUM POINT OF THE LOGISTIC MAP;International Journal of Bifurcation and Chaos;2013-07

3. Statistical versus optimal partitioning for block entropies;Kybernetes;2013-01-04

4. The many facets of Poincare recurrence theorem of the logistic map;Kybernetes;2012-06-08

5. Recent developments in the digital approach of symbolic dynamics;Kybernetes;2011-06-14