We introduce Peano words, which are words corresponding to finite approximations of the Peano space filling curve. We find the number of occurrences of certain patterns in these words. We give a tag-system to generate automatically these words and, by showing that they are almost cube-free, we prove that they cannot be obtained by simply iterating a morphism.
|Number of pages||17|
|Journal||Journal of Automata, Languages and Combinatorics|
|Publication status||Published - Oct 2004|