Email Alert    RSS

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

• 论文 • 上一篇    下一篇

ON GRAMMATICAL COMPLEXITY OF A CLASS OF ATTRACTORS

卢钦和   

  1. Department of Mathematics, Suzhou University, Suzhou 215006, P. R. China
  • 收稿日期:1993-09-10 出版日期:1996-02-18 发布日期:1996-02-18
  • 基金资助:

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

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

PDF

422

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

关键词: formal language, kneading sequence, complexity

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
Total visitors:
Copyright © Applied Mathematics and Mechanics (English Edition)
Address：P. O. Box 122, Shanghai University, 99 Shangda Road, Shanghai 200444, China
E-mail： amm@department.shu.edu.cn
Technical support: Beijing Magtech Co.ltd support@magtech.com.cn