A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
A new geometric approach to Sturmian words
Tekijät: Matomaki K, Saari K
Kustantaja: ELSEVIER SCIENCE BV
Julkaisuvuosi: 2012
Journal: Theoretical Computer Science
Tietokannassa oleva lehden nimi: THEORETICAL COMPUTER SCIENCE
Lehden akronyymi: THEOR COMPUT SCI
Vuosikerta: 432
Aloitussivu: 77
Lopetussivu: 84
Sivujen määrä: 8
ISSN: 0304-3975
DOI: https://doi.org/10.1016/j.tcs.2012.01.040
Tiivistelmä
We introduce a new geometric approach to Sturmian words by means of a mapping that associates certain lines in the n x n-grid and sets of finite Sturmian words of length n. Using this mapping, we give new proofs of the formulas enumerating the finite Sturmian words and the palindromic finite Sturmian words of a given length. We also give a new proof for the well-known result that a factor of a Sturmian word has precisely two return words. (C) 2012 Elsevier B.V. All rights reserved.
We introduce a new geometric approach to Sturmian words by means of a mapping that associates certain lines in the n x n-grid and sets of finite Sturmian words of length n. Using this mapping, we give new proofs of the formulas enumerating the finite Sturmian words and the palindromic finite Sturmian words of a given length. We also give a new proof for the well-known result that a factor of a Sturmian word has precisely two return words. (C) 2012 Elsevier B.V. All rights reserved.
Turun yliopiston Tutkimustietojärjestelmän portaali