Abstract:

Let f denote a system induced by a nonprimitive and nonconstantlength substitution over the alphabet {0,1}. We investigated the topological entropy of f and the possibilities for f to occur chaoticbehaviors and proved that the topological entropy of f is zero, and gave a sufficient condition for f to contain no distributively chaotic pairs.

Key words: substitution system, chaos, topological entropy