Production en temps réel et complexité de structure de suites infinies
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 23 (1989) no. 2, pp. 195-216. 
@article{ITA_1989__23_2_195_0,
     author = {Bleuzen-Guernalec, No\"elle and Blanc, Georges},
     title = {Production en temps r\'eel et complexit\'e de structure de suites infinies},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {195--216},
     publisher = {EDP-Sciences},
     volume = {23},
     number = {2},
     year = {1989},
     mrnumber = {1001726},
     zbl = {0681.68055},
     language = {fr},
     url = {http://archive.numdam.org/item/ITA_1989__23_2_195_0/}
}
TY  - JOUR
AU  - Bleuzen-Guernalec, Noëlle
AU  - Blanc, Georges
TI  - Production en temps réel et complexité de structure de suites infinies
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1989
SP  - 195
EP  - 216
VL  - 23
IS  - 2
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1989__23_2_195_0/
LA  - fr
ID  - ITA_1989__23_2_195_0
ER  - 
%0 Journal Article
%A Bleuzen-Guernalec, Noëlle
%A Blanc, Georges
%T Production en temps réel et complexité de structure de suites infinies
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1989
%P 195-216
%V 23
%N 2
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1989__23_2_195_0/
%G fr
%F ITA_1989__23_2_195_0
Bleuzen-Guernalec, Noëlle; Blanc, Georges. Production en temps réel et complexité de structure de suites infinies. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 23 (1989) no. 2, pp. 195-216. http://archive.numdam.org/item/ITA_1989__23_2_195_0/

[BER; 1]J. Berstel, Mots sans carré et morphismes itérés, Discrete Mathematics, vol. 29, 1980, p. 235-244. | MR | Zbl

[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 | Zbl

[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 | Numdam | MR | Zbl

[COB; 4]A. Gobham, Uniform Tag Sequences, Math. Syst. Theory, vol. 6, n°2, 1972, p. 164-192. | MR | Zbl

[COV; 5]E. CovenetG. Hedlund, Sequences with Minimal Block Growth., Math. Syst. Theory, vol.7, 1973, p. 138-153. | MR | Zbl

[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 | Zbl

[EIL; 7]S. Eilenberg, Automata, Languages and Machines, Academic Press, volume A. | Zbl

[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 | Zbl

[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 | Zbl

[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 | Zbl

[HOP, 11]J. Hopcroft et J. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley Publishing Company. | MR | Zbl

[MIN; 12]M. L. Minsky, Computation: Finite and Infinite Machines, Prentice-Hall, Englewood Cliffs N. J., 1967. | MR | Zbl

[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. | Numdam | MR | Zbl

[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.

[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 | Zbl

[ROS; 16]A. L. Rosenberg, Real Time Definable Languages, J. Assoc. Comput. Mach., 1967, p. 645-662. | MR | Zbl