Production en temps réel et complexité de structure de suites infinies

Noëlle Bleuzen-Guernalec; Georges Blanc

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1989)

  • Volume: 23, Issue: 2, page 195-216
  • ISSN: 0988-3754

How to cite

top

Bleuzen-Guernalec, Noëlle, and Blanc, Georges. "Production en temps réel et complexité de structure de suites infinies." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 23.2 (1989): 195-216. <http://eudml.org/doc/92331>.

@article{Bleuzen1989,
author = {Bleuzen-Guernalec, Noëlle, Blanc, Georges},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {real time product sequences; complexity of factors},
language = {fre},
number = {2},
pages = {195-216},
publisher = {EDP-Sciences},
title = {Production en temps réel et complexité de structure de suites infinies},
url = {http://eudml.org/doc/92331},
volume = {23},
year = {1989},
}

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
PB - EDP-Sciences
VL - 23
IS - 2
SP - 195
EP - 216
LA - fre
KW - real time product sequences; complexity of factors
UR - http://eudml.org/doc/92331
ER -

References

top
  1. [BER; 1] J. BERSTEL, Mots sans carré et morphismes itérés, Discrete Mathematics, vol. 29, 1980, p. 235-244. Zbl0444.20050MR560766
  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. Zbl0578.68069MR777740
  3. [CHR; 3] C. CHRISTOL, T. KAMAE, M. MENDES-FRANCEet G. RAUZY, Suites algébriques, automates et substitutions, Bull. Soc. Math. France, vol. 108, 1980, p. 401-419. Zbl0472.10035MR614317
  4. [COB; 4] A. GOBHAM, Uniform Tag Sequences, Math. Syst. Theory, vol. 6, n°2, 1972, p. 164-192. Zbl0253.02029MR457011
  5. [COV; 5] E. COVENet G. HEDLUND, Sequences with Minimal Block Growth., Math. Syst. Theory, vol.7, 1973, p. 138-153. Zbl0256.54028MR322838
  6. [EHR; 6] A. EHRENFEUCHT, K. LEEet G. ROZENBERG, Subword Complexities of Various Classes of deterministic Developmental Languages Without Interaction, Theor. Comput. Sci., vol. 1, 1975, p. 59-75. Zbl0316.68043MR388861
  7. [EIL; 7] S. EILENBERG, Automata, Languages and Machines, Academic Press, volume A. Zbl0248.68004
  8. [FIS; 8] P. C. FISCHER, A. R. MEYERet A. L. ROSENBERG, Counter Machines and Counter Langages, Math. Syst. Theory, vol. 2, 1968, p. 265-283. Zbl0165.32002MR235932
  9. [FIS; 9] P. C. FISCHER, A. R. MEYERet A. L. ROSENBERG, Time Restricted Sequence Generation, J. Comp. Syst. Sci., vol. 4, 1970, p. 50-73. Zbl0191.18301MR253594
  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. Zbl0131.15404MR170805
  11. [HOP, 11] J. HOPCROFT et J. ULLMAN, Introduction to Automata Theory, Languages and Computation, Addison-Wesley Publishing Company. Zbl0426.68001MR645539
  12. [MIN; 12] M. L. MINSKY, Computation: Finite and Infinite Machines, Prentice-Hall, Englewood Cliffs N. J., 1967. Zbl0195.02402MR356580
  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. Zbl0521.20042MR713226
  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. 
  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. Zbl0571.68065MR814743
  16. [ROS; 16] A. L. ROSENBERG, Real Time Definable Languages, J. Assoc. Comput. Mach., 1967, p. 645-662. Zbl0153.00902MR234783

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.