Lower bounds for symbolic complexity of iceberg dynamical systems

A. A. Prikhod'ko

The symbolic complexity of an infinite word $W$ is the function $p_W(l)$ counting the number of different subwords in $W$ of length $l$. In this paper our main purpose is to study…