Automatic complexity of shift register sequences

Let $x$ be an $m$-sequence, a maximal length sequence produced by a linear feedback shift register. We show that $x$ has maximal subword complexity function in the sense of Allouche and Shallit. We show that this implies that the nondeterministic automatic complexity $A_N(x)$ is close to maximal: $n\mathrm{/}2-A_N(x)=O({\log }^{2}n)$, where $n$ is the length of $x$. In contrast, Hyde has shown $A_N(y)\le n\mathrm{/}2+1$ for all sequences $y$ of length $n$.