Distributional chaos in constant-length substitution systems (Q2654013)

The notion of distributional chaos is some generalization of chaotic behaviour in the sense of Li and Yorke where instead of distances along orbits of discrete dynamical systems the distribution of these distances is considered. In the present paper the authors derive a necessary and sufficient condition for a primitive substitution constant-length systems to exhibit distributional chaos. Their condition shows in particular that this strong form of chaos can only occur in such constant-length substitution systems if the alphabet consists of at least four letters.