Un algorithme de calcul formel des séries énumératrices de langage linéaire

M. P. Franchi-Zannettacci

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

  • Volume: 17, Issue: 4, page 343-364
  • ISSN: 0988-3754

How to cite

top

Franchi-Zannettacci, M. P.. "Un algorithme de calcul formel des séries énumératrices de langage linéaire." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 17.4 (1983): 343-364. <http://eudml.org/doc/92193>.

@article{Franchi1983,
author = {Franchi-Zannettacci, M. P.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {statistical study of proteins; linear language; unambiguous linear grammar; generating function; number of words},
language = {fre},
number = {4},
pages = {343-364},
publisher = {EDP-Sciences},
title = {Un algorithme de calcul formel des séries énumératrices de langage linéaire},
url = {http://eudml.org/doc/92193},
volume = {17},
year = {1983},
}

TY - JOUR
AU - Franchi-Zannettacci, M. P.
TI - Un algorithme de calcul formel des séries énumératrices de langage linéaire
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1983
PB - EDP-Sciences
VL - 17
IS - 4
SP - 343
EP - 364
LA - fre
KW - statistical study of proteins; linear language; unambiguous linear grammar; generating function; number of words
UR - http://eudml.org/doc/92193
ER -

References

top
  1. 1. A. V. AHO et J. D. ULLMAN, The Theory of Parsing, Translation and Compiling, p. 103-124, Prentice Hall, 1972. MR408321
  2. 2. J. BRESTEL et coll., Séries formelles en variables non commutatives, Actes de la cinquième école de printemps d'informatique théorique, Vieux-Boucau-les-Bains, 1976, L.I.T.P., 1978. Zbl0392.00014
  3. 3. R. J. CEDERGREEN, B. LARUE, D. SANKOFF, G. LAPALME et H. GROSJEAN, Convergence and Minimal Mutation Criteria for Evaluating Early Events in t-RNA Evolution, Proc. Nat., Acad., Sc., U.S.A., vol.77, n° 5, 1980, p. 2791-2795. 
  4. 4. N. CHOMSKY et M. P. SCHUTZENBERGER, The Algebric Theory of Context free Languages, North Holland, Amsterdam, 1963. Zbl0148.00804MR152391
  5. 5. D. DEBOUVERIE et J. SCHLUSSELBERG, Research of Specific Contraints in Pair Association of Amino-acids, Biochimie, 56, 1974, p. 1045-1051. 
  6. 6. M. P. FRANCHI-ZANNETTACCI, Étude statistique des enchaînements d'acides aminés par des méthodes combinatoires et l'utilisation du calcul formel, Thèse de 3e cycle, Bordeaux, 1980. 
  7. 7. J. HARDOUIN DUPARC, Une méthode pour la résolution de certains problèmes combinatoires, Thèse d'état, Bordeaux, 1980. 
  8. 8. D. E. KNUTH, Examples of Formal Semantics, Lecture Notes in Mathematics, n° 188, Springer Verlag, 1971. Zbl0221.68014MR337061
  9. 9. P. M. LEWIS, D. J. ROSENCKRANTZ et R. E. STEARNS, Attributed Translations, A.C.M. Symposium on Theory of Computing, 1973, p. 160-171. Zbl0306.68053MR408340
  10. 10. LIVERCY, Theorie des programmes, schémas, preuves, sémantique, Dunos, Paris, 1978. Zbl0416.68007MR546931
  11. 11. P. LUCAS et K. WALK, On the Formal Definition of PL/1, Annual review in automatic programming, 1969, p. 105-182. Zbl0217.53502
  12. 12. S. TANAKA et H. A. SHERAGA, Statistical Treatment of Protein Conformation, Macromolecules, vol. 9, n° 5 1976, p. 812-833. 

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.