论文信息 - Finit Automata-Models for the Investigation of Dynamical Systems

Finit Automata-Models for the Investigation of Dynamical Systems

We describe a method to measure the complexity of a dynamical system. By complexity we mean the intrinsic information processing abilities which we believe to be visible only on an infinitesimal scale. The complexity measure is based on concepts from information theory and from the theory of formal languages.

[1] P. Grassberger. Toward a quantitative theory of self-generated complexity , 1986 .

[2] T. Tél,et al. Statistical properties of chaos demonstrated in a class of one-dimensional maps. , 1993, Chaos.

[3] J. Eckmann,et al. Iterated maps on the interval as dynamical systems , 1980 .

[4] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[5] G. Deco,et al. Exploring the intrinsic information loss in single-humped maps by refining multi-symbol partitions , 1996 .

[6] P. Grassberger. On Symbolic Dynamics of One-Humped Maps of the Interval , 1988 .

[7] R. Günther,et al. Complex systems, complexity measures, grammars and model-inferring , 1994 .

[8] Young,et al. Inferring statistical complexity. , 1989, Physical review letters.

[9] C. Beck,et al. Thermodynamics of chaotic systems : an introduction , 1993 .