| Issue |
RAIRO-Theor. Inf. Appl.
Volume 44, Number 1, January-March 2010
Special issue dedicated to the 12th "Journées Montoises d'Informatique Théorique"
|
|
|---|---|---|
| Page(s) | 59 - 77 | |
| DOI | https://doi.org/10.1051/ita/2010005 | |
| Published online | 11 February 2010 | |
How to build billiard words using decimations
XLim, UMR 6172, Université de Limoges – CNRS, 123 avenue Albert Thomas,
87060 Limoges Cedex, France; borel@unilim.fr
We present two methods based on decimation for computing finite billiard words on any finite alphabet. The first method computes finite billiard words by iteration of some transformation on words. The number of iterations is explicitly bounded. The second one gives a direct formula for the billiard words. Some results remain true for infinite standard Sturmian words, but cannot be used for computation as they only are limit results.
Mathematics Subject Classification: 68R15 / 68Q68
Key words: Decimations.
© EDP Sciences, 2010
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.