一类吸引子的语法复杂性

On Grammatical Complexity of a Class of Attractors

本文研究了Ｆｅｉｇｅｎｂａｕｍ吸引子和周期窗口中Ｆｅｉｓｅｎｂａｕｍ吸引子决定的形式语言，讨论了它们的语法复杂性．证明了这类吸引子都是ＥＴＯＬ语言，从而是上下文有关语言（ＣＳＬ）；而不是上下文无关语言（ＣＦＬ）。

In this paper we discuss the grammatical complexity of the Feigenbaum attractor and the Fcigenbaum attractors in windows. We prove that the languages of these attractors are not a context-free language (CFL) but a con tex t-sensitive one (CSL).