Finite statistical complexity for sofic systems

Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics

Volumn 60, Issue 1, 1999, Pages 459-463

  Perry, Nicolás ^a   Binder, P M ^a,b  

^a UNIVERSIDAD DE LOS ANDES   (Colombia)

^b SANTA FE INSTITUTE   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE;

EID: 0000141337     PISSN: 1063651X     EISSN: None     Source Type: Journal    
DOI: 10.1103/PhysRevE.60.459     Document Type: Article

References (23)

1. Measures of Complexity and Chaos, edited by N. B. Abraham, A. M. Albano, A. Passamante, and P. E. Rapp (Plenum, New York, 1989).
2. R. Badii and A. Politi, Complexity: Hierarchical Structure and Scaling in Physics (Cambridge University Press, Cambridge, 1997).
3. R. Badii and A. Politi, Phys. Rev. Lett. 78, 444 (1997).
4. C. H. Bennett, Found. Phys. 16, 585 (1986).
5. G. Chaitin, Information, Randomness and Incompleteness (World Scientific, Singapore, 1987).
6. J. P. Crutchfield and N. H. Packard, Physica D 7, 201 (1983).
7. J. P. Crutchfield and K. Young, Phys. Rev. Lett. 63, 105 (1989)
8. J. P. Crutchfield, in Nonlinear Modeling and Forecasting, edited by M. Casdagli and S. Eubank (Addison-Wesley, Reading, MA, 1992), p. 317.
9. J. P. Crutchfield and D. P. Feldman, Phys. Rev. E 55, R1239 (1997)
10. D. P. Feldman and J. P. Crutchfield, Phys. Lett. A 238, 244 (1998).
11. G. D’Alessandro and A. Politi, Phys. Rev. Lett. 64, 1609 (1990).
12. P. Grassberger, Int. J. Theor. Phys. 25, 907 (1986)
13. P. Grassberger, Z. Naturforsch. 43a, 671 (1988).
14. R. Landauer, Nature (London) 336, 306 (1988).
15. M. Li and P. M. B. Vitanyi, An Introduction to Kolmogorov Complexity and its Applications (Springer, New York, 1993).
16. W. Li, Complex Syst. 5, 381 (1991).
17. K. Lindgren and M. G. Nordahl, Complex Syst. 2, 409 (1988).
18. S. Lloyd and H. Pagels, Ann. Phys. (N.Y.) 188, 186 (1988).
19. C. H. Papadimitriou, Computational Complexity (Addison-Wesley, Reading, MA, 1994).
20. V. M. Alekseev and M. V. Yakobson, Phys. Rep. 75, 287 (1981).
21. We observe that more tolerance in the definition of equivalence classes results in lower values of complexity. This is reasonable, since higher tolerance leads to fewer equivalence classes; see N. Perry, undergraduate thesis, Universidad de Los Andes, 1998.
22. Consider a string with a very large period (Formula presented) When sampled with sequences of increasing (Formula presented) the statistical complexity grows with (Formula presented) until (Formula presented) at which point the periodicity is recognized and complexity stabilizes at (Formula presented) see Fig. 55. Having zero complexity for periodic sequences would cause a discontinuity in a complexity vs (Formula presented) plot, located at (Formula presented)
23. J. P. Crutchfield and C. R. Shalizi, Phys. Rev. E 59, 275 (1999).