| 摘 要： | 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
|
