K Karamanos 2001 J. Phys. A: Math. Gen. 34 9231 doi:10.1088/0305-4470/34/43/309
K Karamanos
Show affiliationsA given finite sequence of letters over a finite alphabet can always be algorithmically generated, in particular by a Turing machine. This fact is at the heart of complexity theory in the sense of Kolmogorov and Chaitin. A relevant question in this context is whether, given a statistically 'sufficiently long' sequence, there exists a deterministic finite automaton that generates it. In this paper we propose a simple criterion, based on measuring block entropies by lumping, which is satisfied by all automatic sequences. On the basis of this, one can determine that a given sequence is not automatic and obtain interesting information when the sequence is automatic. Following previous work on the Feigenbaum sequence, we give a necessary entropy-based condition valid for all automatic sequences read by lumping. Applications of these ideas to representative examples are discussed. In particular, we establish new entropic decimation schemes for the Thue–Morse, the Rudin–Shapiro and the paperfolding sequences read by lumping.
05.70.Ce Thermodynamic functions and equations of state
02.30.Lt Sequences, series, and summability
87.15.Cc Folding: thermodynamics, statistical mechanics, models, and pathways
Issue 43 (2 November 2001)
Received 3 October 2000, in final form 17 July 2001
Published 19 October 2001
K Karamanos 2001 J. Phys. A: Math. Gen. 34 9231
Robert Moestam and Jan Weiland 2003 Nucl. Fusion 43 1135
Megan Donahue et al. 1998 ApJ 502 550
Tomoya Hirota et al. 2002 ApJ 565 359
B M Annaratone and G E Morfill 2003 J. Phys. D: Appl. Phys. 36 2853
Yu Ning et al 2009 Chinese Phys. Lett. 26 112101
Bozena Ratajska-Gadomska 1999 J. Phys. B: At. Mol. Opt. Phys. 32 3463
Lei Zhang et al 2002 J. Phys.: Condens. Matter 14 5187
D. B. Melrose and M. E. Gedalin 1999 ApJ 521 351
R Mukhiya et al 2006 J. Micromech. Microeng. 16 2458