Un langage algébrique particulier
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 13 (1979) no. 3, pp. 203-215.
@article{ITA_1979__13_3_203_0,
     author = {Boasson, L.},
     title = {Un langage alg\'ebrique particulier},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {203--215},
     publisher = {EDP-Sciences},
     volume = {13},
     number = {3},
     year = {1979},
     zbl = {0424.68042},
     mrnumber = {554682},
     language = {fr},
     url = {http://www.numdam.org/item/ITA_1979__13_3_203_0/}
}
TY  - JOUR
AU  - Boasson, L.
TI  - Un langage algébrique particulier
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1979
DA  - 1979///
SP  - 203
EP  - 215
VL  - 13
IS  - 3
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1979__13_3_203_0/
UR  - https://zbmath.org/?q=an%3A0424.68042
UR  - https://www.ams.org/mathscinet-getitem?mr=554682
LA  - fr
ID  - ITA_1979__13_3_203_0
ER  - 
Boasson, L. Un langage algébrique particulier. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 13 (1979) no. 3, pp. 203-215. http://www.numdam.org/item/ITA_1979__13_3_203_0/

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. | Zbl 0363.68106

2. L. Boasson, Cônes rationnels et familles agréables de langages, Thèse de 3e cycle, Université Paris-VII, 1971.

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

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. | MR 489028 | Zbl 0361.68111

5. L. Boasson et M. Nivat, Parenthesis Generators, 17th Annual Symposium on F.O.C.S. (ex. SWAT), 1976, p. 253-257. | MR 455560

6. C. Frougny, Langages très simples générateurs, R.A.I.R.O., Informatique théorique, vol. 13, 1979, p. 69-86. | Numdam | MR 525458 | Zbl 0405.68063

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

8. S. Greibach, One Counter Languages and the IRS Condition, J. Comp. System. Science, vol. 10, 1975, p. 237-247. | MR 395352 | Zbl 0307.68062

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. | Numdam | MR 510641 | Zbl 0387.68050

10. W. Ogden, A Helpful Result for Proving Inherent Ambiguity, Math. Systems Theory, vol. 2, 1967, p. 191-194. | MR 233645 | Zbl 0175.27802

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. | MR 495182 | Zbl 0431.68077

12. A. Salomaa, Formal Languages, Academic press, 1973. | MR 438755 | Zbl 0262.68025