Langages très simples générateurs
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 13 (1979) no. 1, pp. 69-86.
@article{ITA_1979__13_1_69_0,
     author = {Frougny, Christiane},
     title = {Langages tr\`es simples g\'en\'erateurs},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {69--86},
     publisher = {EDP-Sciences},
     volume = {13},
     number = {1},
     year = {1979},
     zbl = {0405.68063},
     mrnumber = {525458},
     language = {fr},
     url = {http://www.numdam.org/item/ITA_1979__13_1_69_0/}
}
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
DA  - 1979///
SP  - 69
EP  - 86
VL  - 13
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1979__13_1_69_0/
UR  - https://zbmath.org/?q=an%3A0405.68063
UR  - https://www.ams.org/mathscinet-getitem?mr=525458
LA  - fr
ID  - ITA_1979__13_1_69_0
ER  - 
Frougny, Christiane. Langages très simples générateurs. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 13 (1979) no. 1, pp. 69-86. http://www.numdam.org/item/ITA_1979__13_1_69_0/

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. | MR 345452 | Zbl 0329.68067

2. L. Boasson, Un langage algébrique particulier [R.A.I.R.O., Informatique théorique (à paraître)]. | Numdam | Zbl 0424.68042

3. L. Boasson et M. Nivat, Sur diverses familles de langages fermées par transduction rationnelle, Acta Informatica, vol. 2, 1973, p. 180-188 | MR 331873 | Zbl 0242.68037

4. L. Boasson et M. Nivat, Parenthesis Generators, 17th I.E.E.E. Symposium ou foundations of computer science, Houston, 1976, p. 253-257. | MR 455560

5. S. Eilenberg, in Actes Congrès intern. Math., t. 3, 1970, p. 265-267. | Zbl 0231.68024

6. S. Ginsburg et S. Greibach, Studies in Abstracts Families of Languages, Memoirs Amer. math. Soc., vol. 87, 1969, p. 1-32. | MR 297491 | Zbl 0194.31402

7. S. Ginsburg et S. Greibach, Principal AFL, J. Comput. System. Se, vol. 4, 1970, p. 308-338. | MR 286599 | Zbl 0198.03102

8. S. Greibach, Chains of Full AFL's, Math. System. Theory, vol. 4, 1970, p. 231-242. | MR 329324 | Zbl 0203.30102

9. S. Greibach, One-Counter Languages and the I.R.S. Condition, J. Comput. System. Sc., vol. 10, 1975, p. 237-247. | MR 395352 | Zbl 0307.68062

10. Hopcroft et Korenjak, Simple Deterministic Languages, 7th I.E.E.E.E., Symposium on switching and automata theory, 1966, p. 36-46. | Zbl 0313.68061

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. | MR 445926