Applied Mathematics and Mechanics (English Edition) ›› 1996, Vol. 17 ›› Issue (2): 163-168.

• Articles • Previous Articles     Next Articles

ON GRAMMATICAL COMPLEXITY OF A CLASS OF ATTRACTORS

Lu Qinhe   

  1. Department of Mathematics, Suzhou University, Suzhou 215006, P. R. China
  • Received:1993-09-10 Online:1996-02-18 Published:1996-02-18
  • Supported by:

    Project supported by National Scale Project "Nonlinear Science" of China

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 ine(CSL).

Key words: formal language, kneading sequence, complexity

APS Journals | CSTAM Journals | AMS Journals | EMS Journals | ASME Journals