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

GRAMMATICAL COMPLEXITY OF FEIGENBAUM TYPE ATTRACTORS IN PERIODIC WINDOWS
引用本文:陈曦,卢钦和. GRAMMATICAL COMPLEXITY OF FEIGENBAUM TYPE ATTRACTORS IN PERIODIC WINDOWS[J]. 苏州大学学报(医学版), 1995, 11(2): 17-22
作者姓名:陈曦  卢钦和
作者单位:Department of Mathematics,Department of Mathematics
摘    要:In [7,8] the grammatical complexity of the Feigenbaurn attractor and the general Feigenbaurn attractors, generated by period - n - tupling, are studied. In this paper we study the grammatical complexity of the Feigenbaurn type attractors, including Feigenbaurn attractors and general Feigenbaurn attractors,in periodic windows. It is shown that the languages determined by these attractors are CLS and are. not CFL.

关 键 词:语法复杂度  周期视窗  正式语言  捏合序列  Feigenbaum吸引子  空间地图  动力系统

GRAMMATICAL COMPLEXITY OF FEIGENBAUM TYPE ATTRACTORS IN PERIODIC WINDOWS
Chen Xi Lu Qinhe. GRAMMATICAL COMPLEXITY OF FEIGENBAUM TYPE ATTRACTORS IN PERIODIC WINDOWS[J]. Journal of Suzhou University(Natural Science), 1995, 11(2): 17-22
Authors:Chen Xi Lu Qinhe
Affiliation:[2]Departmentofmathematics,SuzhouUniversity
Abstract:In [7,8] the grammatical complexity of the Feigenbaum attractor and the general Feigenbaum attractors,generated by period-n-tupling,are studied. In this paper we study the grammatical complexity of the Feigenbaum type attractors ,including Felgenbaum attractors and general Fdgenbaum attractors,in periodic windows. It is shown that the languages determined by these attractors are CLS and are not CFL.
Keywords:formal language  kneading sequence   complexity.
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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