EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 31 / No 3 (1997) RAIRO-Theor. Inf. Appl., 31 3 (1997) 271-290 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 31, Number 3, 1997
Page(s) 271 - 290
DOI https://doi.org/10.1051/ita/1997310302711
Published online 01 February 2017
  1. 1. J. BERSTEL, Fibonacci words - a survey, in G. Rosenberg, A. Salomaa eds., The Book of L, Springer-Verlag, Berlin, 1986. [Zbl: 0589.68053] [Google Scholar]
  2. 2. J. BERSTEL and P. SÉÉBOLD, A characterization of Sturmian morphisms, in A. BORZYSKOWSKI, S. SOKOLOWSKI eds., MFCS '93, Lect. Notes Comp. Sci. Springer-Verlag, 1993. [MR: 1265070] [Zbl: 0925.11026] [Google Scholar]
  3. 3. J. BERSTEL and P. SÉÉBOLD, A remark on morphic Sturmian words, R.A.I.R.O., I.T. 1994, 28, 3-4, pp. 255-263. [EuDML: 92479] [MR: 1282447] [Zbl: 0883.68104] [Google Scholar]
  4. 4. T.C. BROWN, Description of the Characteristic Sequence of an irrational, Canad. Math. Bull., 1993, 36, 1, pp. 15-21. [MR: 1205889] [Zbl: 0804.11021] [Google Scholar]
  5. 5. E. M. COVEN and G. A. HEDLUND, Sequences with Minimal Block Growth, Math. System Theory, 1973, 7, 2, pp. 138-153. [MR: 322838] [Zbl: 0256.54028] [Google Scholar]
  6. 6. D. CRISP, W. MORAN, A. POLLINGTON and P. SHIVE, Substitution invariant cutting sequences, Journal de Théorie des Nombres de Bordeaux, 1993, 5, pp. 123-137. [EuDML: 93567] [MR: 1251232] [Zbl: 0786.11041] [Google Scholar]
  7. 7. A. de LUCA and F. MIGNOSI, Some Combinatorial Properties of Sturmian Words, Theoretical Computer Science 136, 1994, pp. 361-385. [MR: 1311214] [Zbl: 0874.68245] [Google Scholar]
  8. 8. X. DROUBAY, Palindromes in the Fibonacci word, Inf. Proc. Lett., 1995, 55, pp. 217-221. [MR: 1351896] [Zbl: 1004.68537] [Google Scholar]
  9. 9. S. DULUCQ and D. GOUYOU-BEAUCHAMPS, Sur les facteurs des suites de Sturm, Theoretical Computer Science, 1990, 71, pp. 381-400. [MR: 1057771] [Zbl: 0694.68048] [Google Scholar]
  10. 10. G. A. HEDLUND and M. MORSE, Symbolic Dynamics II. Sturmian Trajectories, Amer. J. Math., 1940, 62, pp.1-42. [Zbl: 0022.34003] [MR: 745] [JFM: 66.0188.03] [Google Scholar]
  11. 11. J. JUSTIN and G. PIRILLO, On a combinatorial property of Sturmian words, Theoretical Computer Science, 1996, 154, pp. 387-394. [MR: 1369538] [Zbl: 0872.68144] [Google Scholar]
  12. 12. F. MIGNOSI, Infinite words with linear subword complexity, Theoretical Computer Science, 1989, 65, pp. 221-242. [MR: 1020489] [Zbl: 0682.68083] [Google Scholar]
  13. 13. F. MIGNOSI and P. SÉÉBOLD, Morphismes sturmiens et règles de Rauzy, Journal de Théorie des Nombres de Bordeaux, 1993, 5, pp.221-223. [EuDML: 93580] [MR: 1265903] [Zbl: 0797.11029] [Google Scholar]
  14. 14. M. LOTHAIRE, Combinatorics on Words, Addison-Wesley Pub. Co., London, 1983. [MR: 675953] [Zbl: 0514.20045] [Google Scholar]
  15. 15. G. RAUZY, Mots infinis en arithmétique, in Automata on Infinite Words, M.Nivat, D. Perrin Editors, Lect. Notes in Computer Science, vol. 192, Springer-Verlag, Berlin 1985. [MR: 814741] [Zbl: 0613.10044] [Google Scholar]
  16. 16. C. SERIES, The geometry of Markoff numbers, Math. Intelligencer, 1985, 7, pp. 20-29. [MR: 795536] [Zbl: 0566.10024] [Google Scholar]
  17. 17. B. A. VENKOV, Elementary Number Theory Translated and edited by H. Alderson, Wolters-Noordhoff, Groningen, 1970. [MR: 265267] [Zbl: 0204.37101] [Google Scholar]

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.