Mots infinis engendrés par une grammaire algébrique

Maurice Nivat

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

  • Volume: 11, Issue: 4, page 311-327
  • ISSN: 0988-3754

How to cite

top

Nivat, Maurice. "Mots infinis engendrés par une grammaire algébrique." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 11.4 (1977): 311-327. <http://eudml.org/doc/92059>.

@article{Nivat1977,
author = {Nivat, Maurice},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
language = {fre},
number = {4},
pages = {311-327},
publisher = {EDP-Sciences},
title = {Mots infinis engendrés par une grammaire algébrique},
url = {http://eudml.org/doc/92059},
volume = {11},
year = {1977},
}

TY - JOUR
AU - Nivat, Maurice
TI - Mots infinis engendrés par une grammaire algébrique
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1977
PB - EDP-Sciences
VL - 11
IS - 4
SP - 311
EP - 327
LA - fre
UR - http://eudml.org/doc/92059
ER -

References

top
  1. 1. A. ARNOLD et M. NIVAT, Non-Deterministic Recursive Program Schemes, à paraitre dans Fundamentals of Computation Theory, Lecture Notes in Computer Science, n° 56, p. 12-21, Springer Verlag, 1977. Zbl0361.68020MR502120
  2. 2. Y. CHOUEKA, Theories of Automata on ω-Tapes: a Simplified Approach, J. Comp. Syst. Sciences, vol. 8, 1974, p. 117-141. Zbl0292.02033MR342378
  3. 3. R. COHEN et A. GOLD, Theory of ω-Languages; Part I: Characterizations of ω-Context-Free Languagés, J. Comp. Syst. Sciences, vol. 15, 1977, p. 169-184. Zbl0363.68113MR483741
  4. 4. S. EILENBERG, Automata, Languages and Machines, vol. A, Academic Press, New York, 1974. Zbl0317.94045MR530382
  5. 5. R. MCNAUGHTON, Testing and Generating Infinite Sequences by a Finite Automaton, Inf. and Control, vol. 9, 1966, p. 521-530. Zbl0212.33902MR213241
  6. 6. M. P. SCHÜTZENBERGER, Push-Down Automata and Context-Free Languages, Inf. and Control, vol. 6, 1963, p. 246-264. Zbl0123.12502MR163809

Citations in EuDML Documents

top
  1. Bruno Courcelle, Arbres infinis et systèmes d'équations
  2. Maurice Nivat, Sur les ensembles de mots infinis engendrés par une grammaire algébrique
  3. Bruno Courcelle, Frontiers of infinite trees
  4. André Arnold, Sémantique des processus communicants
  5. Michel Latteux, Mots infinis et langages commutatifs
  6. Stephan Heilbrunner, An algorithm for the solution of fixed-point equations for infinite words
  7. Olivier Finkel, Highly Undecidable Problems For Infinite Computations
  8. B. Courcelle, Algebraic and Regular Trees

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.