Langages très simples générateurs

Christiane Frougny

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

  • Volume: 13, Issue: 1, page 69-86
  • ISSN: 0988-3754

How to cite

top

Frougny, Christiane. "Langages très simples générateurs." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 13.1 (1979): 69-86. <http://eudml.org/doc/92091>.

@article{Frougny1979,
author = {Frougny, Christiane},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {Full Abstract Families of Languages; Context Free Languages; Nongenerators; Quasi-Rational; Very Simple Language},
language = {fre},
number = {1},
pages = {69-86},
publisher = {EDP-Sciences},
title = {Langages très simples générateurs},
url = {http://eudml.org/doc/92091},
volume = {13},
year = {1979},
}

TY - JOUR
AU - Frougny, Christiane
TI - Langages très simples générateurs
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1979
PB - EDP-Sciences
VL - 13
IS - 1
SP - 69
EP - 86
LA - fre
KW - Full Abstract Families of Languages; Context Free Languages; Nongenerators; Quasi-Rational; Very Simple Language
UR - http://eudml.org/doc/92091
ER -

References

top
  1. 1. L. BOASSON, The Inclusion of the Substitution Closure of Linear and One-Counter Languages in the Largest Full Sub-AFL of the Family of C.F.L. is Proper, Information Processing Letters, vol. 2, n° 5, 1973, p. 135-140. Zbl0329.68067MR345452
  2. 2. L. BOASSON, Un langage algébrique particulier [R.A.I.R.O., Informatique théorique (à paraître)]. Zbl0424.68042
  3. 3. L. BOASSON et M. NIVAT, Sur diverses familles de langages fermées par transduction rationnelle, Acta Informatica, vol. 2, 1973, p. 180-188 Zbl0242.68037MR331873
  4. 4. L. BOASSON et M. NIVAT, Parenthesis Generators, 17th I.E.E.E. Symposium ou foundations of computer science, Houston, 1976, p. 253-257. MR455560
  5. 5. S. EILENBERG, in Actes Congrès intern. Math., t. 3, 1970, p. 265-267. Zbl0231.68024
  6. 6. S. GINSBURG et S. GREIBACH, Studies in Abstracts Families of Languages, Memoirs Amer. math. Soc., vol. 87, 1969, p. 1-32. Zbl0194.31402MR297491
  7. 7. S. GINSBURG et S. GREIBACH, Principal AFL, J. Comput. System. Se, vol. 4, 1970, p. 308-338. Zbl0198.03102MR286599
  8. 8. S. GREIBACH, Chains of Full AFL's, Math. System. Theory, vol. 4, 1970, p. 231-242. Zbl0203.30102MR329324
  9. 9. S. GREIBACH, One-Counter Languages and the I.R.S. Condition, J. Comput. System. Sc., vol. 10, 1975, p. 237-247. Zbl0307.68062MR395352
  10. 10. HOPCROFT et KORENJAK, Simple Deterministic Languages, 7th I.E.E.E.E., Symposium on switching and automata theory, 1966, p. 36-46. Zbl0313.68061
  11. 11. M. P. SCHUTZENBERGER, Sur un langage equivalent au langage de Dyck, in Logic, Methodology and Philosophy of Sciences, vol. 4 1973, North Holland, p. 197-203. MR445926

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.