Un langage algébrique particulier

L. Boasson

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

  • Volume: 13, Issue: 3, page 203-215
  • ISSN: 0988-3754

How to cite

top

Boasson, L.. "Un langage algébrique particulier." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 13.3 (1979): 203-215. <http://eudml.org/doc/92099>.

@article{Boasson1979,
author = {Boasson, L.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {algebraic languages; rational cone; non-generative languages; Greibach languages},
language = {fre},
number = {3},
pages = {203-215},
publisher = {EDP-Sciences},
title = {Un langage algébrique particulier},
url = {http://eudml.org/doc/92099},
volume = {13},
year = {1979},
}

TY - JOUR
AU - Boasson, L.
TI - Un langage algébrique particulier
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1979
PB - EDP-Sciences
VL - 13
IS - 3
SP - 203
EP - 215
LA - fre
KW - algebraic languages; rational cone; non-generative languages; Greibach languages
UR - http://eudml.org/doc/92099
ER -

References

top
  1. 1. J. BEAUQUIER, Générateurs algébriques non-ambigus, in Automata, Languages and Programming, Third International Colloquium, S. MICHAELSON and R. MILNER, éd., Edinburgh University Press, 1976, p. 66-73. Zbl0363.68106
  2. 2. L. BOASSON, Cônes rationnels et familles agréables de langages, Thèse de 3e cycle, Université Paris-VII, 1971. 
  3. 3. L. BOASSON, The Inclusion of the Substitution Closure of Linear and One Counter Languages in the Largest Full-Sub AFL of the CFL is Proper, Information Processing Letters, vol. 2, 1973, p. 135-140. Zbl0329.68067MR345452
  4. 4. L. BOASSON, Un langage algébrique non-générateur, in 3rd G. I. Conference. Lecture Notes in Comp. Science, n° 48, Springer-Verlag, 1977, p. 145-148. Zbl0361.68111MR489028
  5. 5. L. BOASSON et M. NIVAT, Parenthesis Generators, 17th Annual Symposium on F.O.C.S. (ex. SWAT), 1976, p. 253-257. MR455560
  6. 6. C. FROUGNY, Langages très simples générateurs, R.A.I.R.O., Informatique théorique, vol. 13, 1979, p. 69-86. Zbl0405.68063MR525458
  7. 7. S. GREIBACH, Chains of Full. AFL's, Math. Systems Theory, vol. 4, 1970, p. 231-242. Zbl0203.30102MR329324
  8. 8. S. GREIBACH, One Counter Languages and the IRS Condition, J. Comp. System. Science, vol. 10, 1975, p. 237-247. Zbl0307.68062MR395352
  9. 9. M. NIVAT, Sur les ensembles de mots infinis engendrés par une grammaire algébrique, R.A.I.R.O., Informatique théorique, vol. 12, 1978, p. 259-278. Zbl0387.68050MR510641
  10. 10. W. OGDEN, A Helpful Result for Proving Inherent Ambiguity, Math. Systems Theory, vol. 2, 1967, p. 191-194. Zbl0175.27802MR233645
  11. 11. L. BOASSON, B. COURCELLE et M. NIVAT, A New Complexity Measure for Languages, in A Conference on Theoretical Computer Science, Waterloo, 1977, p. 130-138. Zbl0431.68077MR495182
  12. 12. A. SALOMAA, Formal Languages, Academic press, 1973. Zbl0262.68025MR438755

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.