Generating the Peano curve and counting occurrences of some patterns

Sergey Kitaev, Toufik Mansour, Patrice Seebold

Research output: Contribution to journalArticle

Abstract

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.
Original languageEnglish
Pages (from-to)439-455
Number of pages17
JournalJournal of Automata, Languages and Combinatorics
Volume9
Issue number4
Publication statusPublished - Oct 2004

Cite this