On subshifts with low maximal pattern complexity

Anh N. Le, Ronnie Pavlov, Casey Schlortt

For a finite alphabet $\mathcal{A}$ and a sequence $x\in {\mathcal{A}}^{\mathbb{N}}$, Kamae and Zamboni defined the maximal pattern complexity function $p_x^{\ast }(n)$ as a natural gener…