Generating the Peano Curve and Counting Occurrences of Some Patterns
Sergey Kitaev, Toufik Mansour, Patrice Séébold · 2004
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.