Please wait a minute...
北京大学期刊网 | 作者  审稿人  编委专家  工作人员

首页   |   关于   |   浏览   |   投稿指南   |   新闻公告
数学进展
研究论文
Grammatical Complexity of Feigenbaum Attractor
Grammatical Complexity of Feigenbaum Attractor

陈曦,卢钦和,谢惠民
Chen Xi Lu QinheXie Huimin

(Suzhou University, Suzhou, 215006, Jiangsu, P.R.C.

收稿日期: 1993-04-25
出版日期: 1993-04-25

49
浏览

引用导出
0
    /   /   推荐

摘要  The Feigenbaum attractor is an important case in the dynamical systems of one-dimensional maps . In this paper we analyze the grammatical complexity of theFeigenbaum attractor, using both theories of symbolic dynamics and of formal lan-guages . In the Chomsky's hierarchy, formal languages are classified into fourlevels: regular languages, context-free languages, context-sensitive languages and re-cursively enumerable languages. It was shown in [6] that for one-dimensional cellularautomata, the sets of configurations generated after a finite number of time steps of
No related articles found!
Viewed
Full text


Abstract

Cited

首页 · 关于 · 关于OA · 法律公告 · 收录须知 · 联系我们 · 注册 · 登录


© 2015-2017 北京大学图书馆 .