On the product of balanced sequences
Antonio Restivo; Giovanna Rosone
RAIRO - Theoretical Informatics and Applications (2012)
- Volume: 46, Issue: 1, page 131-145
- ISSN: 0988-3754
Access Full Article
top
Abstract
topHow to cite
topRestivo, Antonio, and Rosone, Giovanna. "On the product of balanced sequences." RAIRO - Theoretical Informatics and Applications 46.1 (2012): 131-145. <http://eudml.org/doc/221967>.
@article{Restivo2012,
abstract = {The product w = u ⊗ v of two sequences u and v is a naturally defined sequence on the alphabet of pairs of symbols. Here, we study when the product w of two balanced sequences u,v is balanced too. In the case u and v are binary sequences, we prove, as a main result, that, if such a product w is balanced and deg(w) = 4, then w is an ultimately periodic sequence of a very special form. The case of arbitrary alphabets is approached in the last section. The partial results obtained and the problems proposed show the interest of the notion of product in the study of balanced sequences. },
author = {Restivo, Antonio, Rosone, Giovanna},
journal = {RAIRO - Theoretical Informatics and Applications},
keywords = {Infinite sequences; Sturmian words; balance; product; infinite sequences},
language = {eng},
month = {3},
number = {1},
pages = {131-145},
publisher = {EDP Sciences},
title = {On the product of balanced sequences},
url = {http://eudml.org/doc/221967},
volume = {46},
year = {2012},
}
TY - JOUR
AU - Restivo, Antonio
AU - Rosone, Giovanna
TI - On the product of balanced sequences
JO - RAIRO - Theoretical Informatics and Applications
DA - 2012/3//
PB - EDP Sciences
VL - 46
IS - 1
SP - 131
EP - 145
AB - The product w = u ⊗ v of two sequences u and v is a naturally defined sequence on the alphabet of pairs of symbols. Here, we study when the product w of two balanced sequences u,v is balanced too. In the case u and v are binary sequences, we prove, as a main result, that, if such a product w is balanced and deg(w) = 4, then w is an ultimately periodic sequence of a very special form. The case of arbitrary alphabets is approached in the last section. The partial results obtained and the problems proposed show the interest of the notion of product in the study of balanced sequences.
LA - eng
KW - Infinite sequences; Sturmian words; balance; product; infinite sequences
UR - http://eudml.org/doc/221967
ER -
References
top- E. Altman, B. Gaujal and A. Hordijk, Balanced sequences and optimal routing. J. ACM47 (2000) 752–775.
- N. Chekhova, P. Hubert and A. Messaoudi, Propriétés combinatoires, ergodiques et arithmétiques de la substitution de Tribonacci. J. Théor. Nombres Bordeaux13 (2001) 371–394.
- C. Choffrut and J. Karhumaki, Combinatorics of words, in G. Rozenberg and A. Salomaa eds., Handbook of Formal Language Theory1. Springer-Verlag, Berlin (1997).
- S. Ferenczi and C. Mauduit, Transcendence of numbers with a low complexity expansion. J. Number Theory67 (1997) 146–161.
- A.S. Fraenkel, Complementing and exactly covering sequences. J. Combin. Theory Ser. A14 (1973) 8–20.
- P. Hubert, Suites équilibrées (french). Theor. Comput. Sci.242 (2000) 91–108.
- M. Lothaire, Algebraic Combinatorics on Words. Cambridge University Press (2002).
- M. Morse and G.A. Hedlund, Symbolic dynamics II. Sturmian trajectories. Amer. J. Math.62 (1940) 1–42.
- R.N. Risley and L.Q. Zamboni, A generalization of sturmian sequences : combinatorial structure and transcendence. Acta Arith.95 (2000) 167–184.
- P.V. Salimov, On uniform recurrence of a direct product. Discrete Math. Theoret. Comput. Sci.12 (2010) 1–8.
- L. Vuillon, Balanced words. Bull. Belg. Math. Soc.10 (2003) 787–805.
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.