EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 23 / No 2 (1989) RAIRO-Theor. Inf. Appl., 23 2 (1989) 195-216 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 23, Number 2, 1989
Page(s) 195 - 216
DOI https://doi.org/10.1051/ita/1989230201951
Published online 01 February 2017
  1. [BER; 1]J. BERSTEL, Mots sans carré et morphismes itérés, Discrete Mathematics, vol. 29, 1980, p. 235-244. [MR: 560766] [Zbl: 0444.20050] [Google Scholar]
  2. [BLE; 2]N. BLEUZEN-GUERNALEC, Suites points fixes de transduction uniforme, C. R. Acad. Sci. Paris, t. 300, série I, n° 3, 1985, p. 85-88. [MR: 777740] [Zbl: 0578.68069] [Google Scholar]
  3. [CHR; 3]C. CHRISTOL, T. KAMAE, M. MENDES-FRANCEetG. RAUZY, Suites algébriques, automates et substitutions, Bull. Soc. Math. France, vol. 108, 1980, p. 401-419. [EuDML: 87381] [MR: 614317] [Zbl: 0472.10035] [Google Scholar]
  4. [COB; 4]A. GOBHAM, Uniform Tag Sequences, Math. Syst. Theory, vol. 6, n°2, 1972, p. 164-192. [MR: 457011] [Zbl: 0253.02029] [Google Scholar]
  5. [COV; 5]E. COVENetG. HEDLUND, Sequences with Minimal Block Growth., Math. Syst. Theory, vol.7, 1973, p. 138-153. [MR: 322838] [Zbl: 0256.54028] [Google Scholar]
  6. [EHR; 6]A. EHRENFEUCHT, K. LEEetG. ROZENBERG, Subword Complexities of Various Classes of deterministic Developmental Languages Without Interaction, Theor. Comput. Sci., vol. 1, 1975, p. 59-75. [MR: 388861] [Zbl: 0316.68043] [Google Scholar]
  7. [EIL; 7]S. EILENBERG, Automata, Languages and Machines, Academic Press, volume A. [Zbl: 0248.68004] [Google Scholar]
  8. [FIS; 8]P. C. FISCHER, A. R. MEYERetA. L. ROSENBERG, Counter Machines and Counter Langages, Math. Syst. Theory, vol. 2, 1968, p. 265-283. [MR: 235932] [Zbl: 0165.32002] [Google Scholar]
  9. [FIS; 9]P. C. FISCHER, A. R. MEYERetA. L. ROSENBERG, Time Restricted Sequence Generation, J. Comp. Syst. Sci., vol. 4, 1970, p. 50-73. [MR: 253594] [Zbl: 0191.18301] [Google Scholar]
  10. [HAR; 10]J. HARTMANIS et R. E. STEARNS, On the Computational Complexity of Algorithms, Trans. Amer. Math. Soc., vol. 117, 1965, p. 285-306. [MR: 170805] [Zbl: 0131.15404] [Google Scholar]
  11. [HOP, 11]J. HOPCROFT et J. ULLMAN, Introduction to Automata Theory, Languages and Computation, Addison-Wesley Publishing Company. [MR: 645539] [Zbl: 0426.68001] [Google Scholar]
  12. [MIN; 12]M. L. MINSKY, Computation: Finite and Infinite Machines, Prentice-Hall, Englewood Cliffs N. J., 1967. [MR: 356580] [Zbl: 0195.02402] [Google Scholar]
  13. [PAN; 13]J. J. PANSIOT, Mots infinis de Fibonacci et morphismes itérés, RAIRO Informatique Théorique, vol. 17, n° 2, 1983, p. 131-135. [EuDML: 92181] [MR: 713226] [Zbl: 0521.20042] [Google Scholar]
  14. [PAN; 14]J. J. PANSIOT, Accessibilité et morphismes itérés, Thèse publiée par I.R.M.A. Strasbourg, 1983, p. 105-143. [Google Scholar]
  15. [PAN; 15]J. J. PANSIOT, On Various Classes of Infinite Words Obtained by Iterated Mappings, Lecture Notes in Computer Science, n° 192, p. 188-197. [MR: 814743] [Zbl: 0571.68065] [Google Scholar]
  16. [ROS; 16]A. L. ROSENBERG, Real Time Definable Languages, J. Assoc. Comput. Mach., 1967, p. 645-662. [MR: 234783] [Zbl: 0153.00902] [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.