Search

Article

x

留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
邮箱
手机号码
标题
留言内容
验证码

Lattice complexity and fine-graining of symbolic sequence

Ke Da-Guan Zhang Hong Tong Qin-Ye

Citation:

Lattice complexity and fine-graining of symbolic sequence

Ke Da-Guan, Zhang Hong, Tong Qin-Ye
PDF
Get Citation

(PLEASE TRANSLATE TO ENGLISH

BY GOOGLE TRANSLATE IF NEEDED.)

  • A new measure of complexity for finite symbol sequences, named as lattice comple xity, is presented, based on LempelZiv complexity and the symbolic dynamics of onedimensional iterated maps system. To make lattice complexity distinguished from LempelZiv measure, an approach called finegraining method is also prop osed. When finegraining order is small enough, the two measures are almost equ al. When finegraining order goes to large, the differentiation between them be comes apparent. Applying these measures to studies of logistic map, we find thos e be regarded as complex sequences by lattice complexity are clearly generated a t the edge of the chaotic region. The derived properties of the measures are als o discussed.
Metrics
  • Abstract views:  6991
  • PDF Downloads:  872
  • Cited By: 0
Publishing process
  • Received Date:  17 February 2004
  • Accepted Date:  24 May 2004
  • Published Online:  05 January 2005

/

返回文章
返回