Lu Qinhe. On Grammatical Complexity of a Class of Attractors[J]. Applied Mathematics and Mechanics, 1996, 17(2): 157-162.
Citation: Lu Qinhe. On Grammatical Complexity of a Class of Attractors[J]. Applied Mathematics and Mechanics, 1996, 17(2): 157-162.

On Grammatical Complexity of a Class of Attractors

  • Received Date: 1993-09-10
  • Publish Date: 1996-02-15
  • 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).
  • loading
  • [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).
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (1834) PDF downloads(449) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return