一类吸引子的语法复杂性*
On Grammatical Complexity of a Class of Attractors
-
摘要: 本文研究了Feigenbaum吸引子和周期窗口中Feisenbaum吸引子决定的形式语言,讨论了它们的语法复杂性.证明了这类吸引子都是ETOL语言,从而是上下文有关语言(CSL);而不是上下文无关语言(CFL).Abstract: In this paper, we discuss the grammatical complexity of the Feigenbaum attractor and the Feigenbaum attractors in windows. We prove that the languages of these attractors are not conlexl-free language(CFL) but context-sensitive one(CSL).
-
Key words:
- formal language /
- kneading sequence /
- complexity
-
[1] R.L.Devaney,An Introduction to Chaotic Dynamical Systems,2nd ed.,Addison-Wesley,Reading(1989). [2] J.E.Hopcroft and J.D.Ullman,Introduction to Automata Theory.Languages and Computation.Addison-Wesley,Reading(1979). [3] P.Collet and J.P.Eckmann,Iterated Maps on the Interval as Dynamical Systems,Birkhauser,Boston(1980). [4] M.J.Feigenbaum,Quantitative universality for a class of nonlinear transformations,J.Star.Phys.,19(1978),25-52. [5] W.Ogden,A helpful result for proving inherent ambiguity,Math.Systems Theory,2(1968).191-194. [6] G.Rozenberg and A.Salomaa,The Mathematical Theory of L Systems,Academic Press,N.Y.(1980). [7] B.L.Hao.Elementary Symbolic Dynamics and Chaos in Dissipative Systems,World Scientific.Singapore(1989).
计量
- 文章访问数: 1815
- HTML全文浏览量: 100
- PDF下载量: 449
- 被引次数: 0