TY - JOUR

T1 - Generating the Peano curve and counting occurrences of some patterns

AU - Kitaev, Sergey

AU - Mansour, Toufik

AU - Seebold, Patrice

PY - 2004/10

Y1 - 2004/10

N2 - 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.

AB - 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.

UR - https://personal.cis.strath.ac.uk/sergey.kitaev/index_files/Papers/peano.ps

UR - http://www.jalc.de/

M3 - Article

VL - 9

SP - 439

EP - 455

JO - Journal of Automata, Languages and Combinatorics

JF - Journal of Automata, Languages and Combinatorics

SN - 1430-189X

IS - 4

ER -