首页 | 本学科首页   官方微博 | 高级检索  
     检索      

动力系统的复杂性刻划
引用本文:谢惠民.动力系统的复杂性刻划[J].力学进展,1996,26(3):289-305.
作者姓名:谢惠民
作者单位:中国科学院力学研究所非线性连续介质力学开放实验室
基金项目:国家攀登计划项目,江苏省自然科学基金
摘    要:本文扼要地综述了近年来提出的刻划动力系统复杂性的各种度量.着重点在于将复杂性同随机性区分开.由此对于过去为刻划混沌而提出的度量,其中包括Lyapunov指数、拓扑熵、测度熵和Kolmogorov复杂性等,作了简单回顾.从自动机和信息论的观点对于包括AC、SC、EMC在内的新提出的复杂性度量作了阐述.通过单峰映射和一维元胞自动机等例子对上述复杂性度量进行了比较,并较详细地介绍了利用形式语言和自动机来分析动力系统的方法. 

关 键 词:复杂性    动力系统    形式语言    自动机

CHARACTERIZING COMPLEXITY OF DYNAMICAL SYSTEMS
Xie Huimin.CHARACTERIZING COMPLEXITY OF DYNAMICAL SYSTEMS[J].Advances in Mechanics,1996,26(3):289-305.
Authors:Xie Huimin
Abstract:This paper gives an overview of different measures of complexity proposed to characterize dynamical systems developed during recent years. The emphasis is placed on the distinction of complexity from randomness. Those measures, which were used to characterize chaos, including Lyapunov exponent,topologic al entropy, metric entropy, Kolmogorov complexity etc., are reviewed briefly in this sense. New measures, including AC, SC, EMC among others,are explained from the point of view of both automata and information theory.Through the examples o f unimodal maps and one-dimensional cellular automata,the above-mentioned measures of complexity are compared, and the method of using formal languages and automata to analyze dynamical systems is elucidated in detail.
Keywords:complexity  dynamical systems  formal languages  automata  
本文献已被 CNKI 维普 等数据库收录!
点击此处可从《力学进展》浏览原始摘要信息
点击此处可从《力学进展》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号