Propriétés combinatoires des suites définies par le billard dans les triangles pavants

Theoretical Computer Science

Volumn 164, Issue 1-2, 1996, Pages 165-183

  Hubert, Pascal ^a  

^a AIX MARSEILLE UNIVERSITÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; ENCODING (SYMBOLS);

BILLIARD; CODING SEQUENCES; HALF EQUILATERAL TRIANGLE; INTERVALS; ISOCELES RIGHT TRIANGLE; PARTITION;

COMPUTATIONAL GEOMETRY;

EID: 0030247781     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00208-1     Document Type: Article

References (20)

1. P. Alessandri, Codage des rotations, Mémoire de D.E.A., Université Claude Bernard, Lyon I (1993).
2. P. Arnoux, C. Mauduit, I. Shiokawa and J. Tamura, Complexity of sequences defined by billiards in the cube, Bull Soc. Math. France 122 (1994) 1-12.
3. Yu. Baryshinikov, Complexity of trajectories in rectangular billiards, preprint 1994.
4. J. Berstel and M. Pocciola, A geometric proof of the enumeration formula for Sturmian words, Inf. J. Algebra Computation 3 (1993) 349-355.
5. C. Boldrigini, M. Keane and F. Marchetti, Billiards in polygons, Ann. Probab. 6 (1978) 532-540.
6. I.P. Cornfeld, S.V. Formin and Ya.G. Sinai, Ergodic Theory (Springer, Berlin, 1982).
7. E.M. Coven and G.A. Hedlund, Sequences with minimal block, growth, Math. System Theory 7 (2) (1973) 138-153.
8. A. de Luca and F. Mignosi, Some combinatorial properties of Sturmian words, Theoret. Comput. Sci. 136 (1994) 361-385.
9. S. Duluc and D. Gouyou-Beauchamps, Sur les facteurs des suites de Sturm, Theoret. Comput. Sci. 71 (1990) 381-400.
10. G.A. Hedlund and M. Morse, Symbolic Dynamics II. sturmian trajectories, Amer. J. Math. 62 (1940) 1-42.
11. P. Hubert and G. Rauzy, Dynamique Symbolique du billard dans le triangle équilatéral, préprint, 1994.
12. P. Hubert, Dynamique symbolique des billards polygonaux rationnels, Thèse, Université Aix-Marseille II, 1995.
13. P. Hubert, Complexité de suites définies par des billards rationnels, Bull Soc. Math. France 123 (1995) 257-270.
14. S. Ito and S. Yasutomi, On continued fractions, substitutions and characteristic sequences, Japan J. Math 16 (1990) 287-306.
15. F. Mignosi, On the number of factors of Sturmian words, Theoret. Comput. Sci. 82 (1991) 71-84.
16. N. Nishioka, I. Shiokawa, J. Tamura, Arithmetical properties of a certain power series, J. Number Theory 42 (1992) 61-87.
17. G. Rauzy, Mots infinis en arithmétique, dans: M. Nivat et D. Perrin, eds., Automata on Infinite Words, Lecture Notes in Computer Science, Vol. 192 (Springer, Berlin, 1985) 165-171.
18. G. Rote, Sequence with subword complexity 2n, J. Number Theory 46 (1994) 196-213.
19. P. Séébold, Fibonacci morphisms and sturmian words Theoret. Comput. Sci. 88 (1991) 367-384.
20. S. Tabachnikov, Billiards, Panoramias et Synthèses 1 (1995) Soc. Math. France.