On the Relationship between Complexity and Entropy for Markov Chains and Regular Languages.

作者: Wentian Li

DOI:

关键词:

摘要:

参考文章(14)
Domenico Zambella, Peter Grassberger, Complexity of Forecasting in a Class of Simple Models. Complex Systems. ,vol. 2, ,(1988)
Gregory J. Chaitin, On the Length of Programs for Computing Finite Binary Sequences Journal of the ACM. ,vol. 13, pp. 547- 569 ,(1966) , 10.1145/321356.321363
Charles H. Bennett, On the nature and origin of complexity in discrete, homogeneous, locally-interacting systems Foundations of Physics. ,vol. 16, pp. 585- 592 ,(1986) , 10.1007/BF01886523
Seth Lloyd, Heinz Pagels, Complexity as thermodynamic depth Annals of Physics. ,vol. 188, pp. 186- 213 ,(1988) , 10.1016/0003-4916(88)90094-2
Rajeev Motwani, John E. Hopcroft, Jeffrey D. Ullman, Rotwani, Introduction to Automata Theory, Languages, and Computation ,(1979)
Peter Grassberger, Toward a Quantitative Theory of Self-Generated Complexity International Journal of Theoretical Physics. ,vol. 25, pp. 907- 938 ,(1986) , 10.1007/BF00668821
C Shanndn, W Weaver, The Mathematical Theory of Communication ,(1948)
James P. Crutchfield, Karl Young, Inferring statistical complexity. Physical Review Letters. ,vol. 63, pp. 105- 108 ,(1989) , 10.1103/PHYSREVLETT.63.105
Aleksandr Yakovlevich Khinchin, Mathematical foundations of information theory ,(1957)