The construction of a completely scrambled system by graph covers
arXiv:1509.05535
Abstract
In this paper, we define a new construction of completely scrambled 0-dimensional systems using the inverse limit of sequences of directed graph covers. These examples are transitive and are not locally equicontinuous.