Une extension des langages déterministes

Michèle Soria

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

  • Volume: 17, Issue: 4, page 301-319
  • ISSN: 0988-3754

How to cite

top

Soria, Michèle. "Une extension des langages déterministes." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 17.4 (1983): 301-319. <http://eudml.org/doc/92190>.

@article{Soria1983,
author = {Soria, Michèle},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {context-free languages; quasi deterministic languages; closure properties},
language = {fre},
number = {4},
pages = {301-319},
publisher = {EDP-Sciences},
title = {Une extension des langages déterministes},
url = {http://eudml.org/doc/92190},
volume = {17},
year = {1983},
}

TY - JOUR
AU - Soria, Michèle
TI - Une extension des langages déterministes
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1983
PB - EDP-Sciences
VL - 17
IS - 4
SP - 301
EP - 319
LA - fre
KW - context-free languages; quasi deterministic languages; closure properties
UR - http://eudml.org/doc/92190
ER -

References

top
  1. 1. J. M. AUTEBERT, G. COUSINEAU et M. NIVAT, Théorie des automates et des langages formels, Poly Institut de Programmation, Paris, 1976. 
  2. 2. J. BERSTEL, Transduction and Context Free Languages, Teubner Verlag, 1978. Zbl0424.68040MR549481
  3. 3. L. BOASSON, Langages algébriques, Paires itérantes, et Transductions rationnelles, Theorical Computer Science, vol. 2, 1976, p. 209-223. Zbl0378.68037MR441012
  4. 4. S. EILENBERG, 1976, Automata, Languages and Machines, Vol. B, Academic Press, New York, London. Zbl0359.94067MR530383
  5. 5. S. GINSBURG, The Mathematical Theory of Context Free Languages, Mac Graw Hill, 1966. Zbl0184.28401MR211815
  6. 6. S. GINSBURG et S. GREIBACH, Deterministic Context Free Languages, Information and Control, vol. 9, 1966, p. 620-648. Zbl0145.00802MR207486
  7. 7. S. GREIBACH, Jump PDA's and Hierarchies of Deterministic CF Languages, S.I.A.M. Journal of Computing, vol. 3, 1974, p. 111-127. Zbl0288.68031MR371155
  8. 8. M. HARRISON et I. HAVEL, Strict Deterministic Grammars, J.C.S.S., vol. 7, 1973, p. 237-277. Zbl0261.68036MR319415
  9. 9. T. HIBBARD, A Generalisation of Context Free Determinism, Information and Control, vol. 11, 1967, p. 196-238. Zbl0168.25801MR230574
  10. 10. M. NIVAT, Transduction des langages de Chomsky Annales de l'Institut Fourrier, 1968. Zbl0313.68065MR238633
  11. 11. W. OGDEN, Intercalation Theorems for Pusdown Store and Stack Languages, Ph. D. Thesis, Standford, 1968. MR2618989
  12. 12. C. REUTENAUER, Propriétés arithmétiques et topologiques de séries rationnelles en variables non commutatives. Thèse 3e cycle, Université Paris-VI, 1977. 
  13. 13. J. SAKAROVITCH, Syntaxe des langages de Chomsky, Essai sur le déterminisme, Thèse d'État, Université Paris-VII, Rapport LITP n° 80-10, 1980. 
  14. 14. A. SALOMAA, Formal Languages, Academic Press, New York, 1973. Zbl0262.68025MR438755
  15. 15. M. SORIA, Langages quasi déterministes, Thèse 3e cycle, Université Paris-VII, 1978. 
  16. 16. D. WOTSCHKE, States Can Sometimes Do More Thon Stack Symbols in PDA. Technical Report, Penn State University, 1977. 

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.