A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On maximal pattern complexity of some automatic words

2010
*
Ergodic Theory and Dynamical Systems
*

The pattern complexity of a word for a given pattern S, where S is a finite subset of {0, 1, 2, . . .}, is the number of distinct restrictions of the word to S + n (with n = 0, 1, 2, . . .). The maximal pattern complexity of the word, introduced in the paper of T. Kamae and L. Zamboni [Sequence entropy and the maximal pattern complexity of infinite words. Ergod. Th. & Dynam. Sys. 22 (4) (2002) , 1191-1199], is the maximum value of the pattern complexity of S with #S = k as a function of k = 1,

doi:10.1017/s0143385710000453
fatcat:rgpbmlbrwzfnvjgejaro2vprzi