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.
LanguageEnglish
Pages439-455
Number of pages17
JournalJournal of Automata, Languages and Combinatorics
Volume9
Issue number4
Publication statusPublished - Oct 2004

Cite this

@article{3d4621b0bb184dbc8e156af2b04b351f,
title = "Generating the Peano curve and counting occurrences of some patterns",
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.",
author = "Sergey Kitaev and Toufik Mansour and Patrice Seebold",
year = "2004",
month = "10",
language = "English",
volume = "9",
pages = "439--455",
journal = "Journal of Automata, Languages and Combinatorics",
issn = "1430-189X",
number = "4",

}

Generating the Peano curve and counting occurrences of some patterns. / Kitaev, Sergey; Mansour, Toufik; Seebold, Patrice.

In: Journal of Automata, Languages and Combinatorics, Vol. 9, No. 4, 10.2004, p. 439-455.

Research output: Contribution to journalArticle

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

T2 - Journal of Automata, Languages and Combinatorics

JF - Journal of Automata, Languages and Combinatorics

SN - 1430-189X

IS - 4

ER -