  We find finite-state recurrences to enumerate the words on the alphabet
$[n]^r$ which avoid the patterns 123 and $1k(k-1)\dots2$, and, separately, the
words which avoid the patterns 1234 and $1k(k-1)\dots2$.
