Langages algébriques déterministes non générateurs

L. Boasson; A. Petit

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

  • Volume: 21, Issue: 1, page 41-57
  • ISSN: 0988-3754

How to cite

top

Boasson, L., and Petit, A.. "Langages algébriques déterministes non générateurs." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 21.1 (1987): 41-57. <http://eudml.org/doc/92278>.

@article{Boasson1987,
author = {Boasson, L., Petit, A.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {deterministic context-free language; full generator},
language = {fre},
number = {1},
pages = {41-57},
publisher = {EDP-Sciences},
title = {Langages algébriques déterministes non générateurs},
url = {http://eudml.org/doc/92278},
volume = {21},
year = {1987},
}

TY - JOUR
AU - Boasson, L.
AU - Petit, A.
TI - Langages algébriques déterministes non générateurs
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1987
PB - EDP-Sciences
VL - 21
IS - 1
SP - 41
EP - 57
LA - fre
KW - deterministic context-free language; full generator
UR - http://eudml.org/doc/92278
ER -

References

top
  1. 1. J. BEAUQUIER, Strong Non Deterministic Context-Free Langages, 4th. G.I. Conference. L.N. in C.S. N° 55, 1929, p. 4. Zbl0412.68066
  2. 2. J. BEAUQUIER, Générateurs algébriques et systèmes de paires itérantes, T.C.S., vol. 8, 1979, p. 293-323. Zbl0408.68071MR532474
  3. 3. J. BERSTEL, Transductions and Context-Free Languages, Teubner, 1979. Zbl0424.68040MR549481
  4. 4. L. BOASSON, The Inclusion of the Substitution Closure of Linear and One-Counter Languages in the Largest Sub AFL of the Family of CFL's is Proper, I.P.L., vol. 2, 1973, p. 135-140. Zbl0329.68067MR345452
  5. 5. L. BOASSON, Un langage algébrique particulier, R.A.I.R.O., Informatique théorique, vol. 13, 1979, p. 203-215. Zbl0424.68042MR554682
  6. 6. L. BOASSON, Non-générateurs algébriques et substitution, R.A.I.R.O., Informatique théorique, vol. 19, 1985, p. 125-136. Zbl0569.68060MR803994
  7. 7. L. BOASSON et M. NIVAT, Parenthesis Generators, 17th I.E.E.E. Symposium on Foundations of Computer Science, Houston, 1976, p. 253-257. MR455560
  8. 8. C. FROUGNY, Langages très simples générateurs, R.A.I.R.O., Informatique théorique, vol. 13, 1979, p. 68-86. Zbl0405.68063MR525458
  9. 9. S. GREIBACH, Chains of Full AFL's, math. Syst. Theory, vol. 4, 1970, p. 231-242. Zbl0203.30102MR329324
  10. 10. S. GREIBACH, One Counter Languages and the 1RS Condition, J.C.S.S., vol. 10, 1975, p. 237-247. Zbl0307.68062MR395352
  11. 11. A. PETIT, Déterminisme et non-générateur, Thèse de 3e cycle, Université Paris-VII, 1985. 

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.