This paper deals with the system induced by the non-primitive and non-constant-length substitution ξ over the alphabet {0,1} , where ξ(0) = Oa1…ap-1, ξ( 1 ) = 1,…, 1. It has been proved that this system is Li-Yorke chaotic if and only if there exists i ＞ 0 such that ai = O. In addition, investigating the occurrent frequency of the symbols shows a sufficient condition for the system not to be distributively chaotic.%研究符号集{0,1}上的非本原且非等长代换ζ诱导的系统,这里ζ(0)=0a1…ap-1,ζ(1)=1,…,1,证明了该系统是Li-Yorke混沌当且仅当存在i>0,使得ai=0;并通过对符号出现频率的分析,给出了诱导系统不是分布混沌的一个充分条件.
展开▼
