Standard

Locally catenative sequences and Turtle graphics. / Karhumäki, Juhani; Puzynina, Svetlana.

в: RAIRO - Theoretical Informatics and Applications, Том 45, № 3, 01.07.2011, стр. 311-330.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Karhumäki, J & Puzynina, S 2011, 'Locally catenative sequences and Turtle graphics', RAIRO - Theoretical Informatics and Applications, Том. 45, № 3, стр. 311-330. https://doi.org/10.1051/ita/2011104

APA

Karhumäki, J., & Puzynina, S. (2011). Locally catenative sequences and Turtle graphics. RAIRO - Theoretical Informatics and Applications, 45(3), 311-330. https://doi.org/10.1051/ita/2011104

Vancouver

Karhumäki J, Puzynina S. Locally catenative sequences and Turtle graphics. RAIRO - Theoretical Informatics and Applications. 2011 Июль 1;45(3):311-330. https://doi.org/10.1051/ita/2011104

Author

Karhumäki, Juhani ; Puzynina, Svetlana. / Locally catenative sequences and Turtle graphics. в: RAIRO - Theoretical Informatics and Applications. 2011 ; Том 45, № 3. стр. 311-330.

BibTeX

@article{a648f9a29d15435da7a803b11905ac9f,
title = "Locally catenative sequences and Turtle graphics",
abstract = "Motivated by striking properties of the well known Fibonacci word we consider pictures which are defined by this word and its variants via so-called turtle graphics. Such a picture can be bounded or unbounded. We characterize when the picture defined by not only the Fibonacci recurrence, but also by a general recurrence formula, is bounded, the characterization being computable.",
keywords = "Combinatorics on words, Fibonacci word, Locally catenative sequences, Turtle graphics",
author = "Juhani Karhum{\"a}ki and Svetlana Puzynina",
year = "2011",
month = jul,
day = "1",
doi = "10.1051/ita/2011104",
language = "English",
volume = "45",
pages = "311--330",
journal = "RAIRO - Theoretical Informatics and Applications",
issn = "0988-3754",
publisher = "EDP Sciences",
number = "3",

}

RIS

TY - JOUR

T1 - Locally catenative sequences and Turtle graphics

AU - Karhumäki, Juhani

AU - Puzynina, Svetlana

PY - 2011/7/1

Y1 - 2011/7/1

N2 - Motivated by striking properties of the well known Fibonacci word we consider pictures which are defined by this word and its variants via so-called turtle graphics. Such a picture can be bounded or unbounded. We characterize when the picture defined by not only the Fibonacci recurrence, but also by a general recurrence formula, is bounded, the characterization being computable.

AB - Motivated by striking properties of the well known Fibonacci word we consider pictures which are defined by this word and its variants via so-called turtle graphics. Such a picture can be bounded or unbounded. We characterize when the picture defined by not only the Fibonacci recurrence, but also by a general recurrence formula, is bounded, the characterization being computable.

KW - Combinatorics on words

KW - Fibonacci word

KW - Locally catenative sequences

KW - Turtle graphics

UR - http://www.scopus.com/inward/record.url?scp=80053026996&partnerID=8YFLogxK

U2 - 10.1051/ita/2011104

DO - 10.1051/ita/2011104

M3 - Article

AN - SCOPUS:80053026996

VL - 45

SP - 311

EP - 330

JO - RAIRO - Theoretical Informatics and Applications

JF - RAIRO - Theoretical Informatics and Applications

SN - 0988-3754

IS - 3

ER -

ID: 41131207