no. 3
Un langage algébrique particulier
RAIRO. Informatique théorique, 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. Informatique th\'eorique},
     pages = {203--215},
     publisher = {EDP-Sciences},
     volume = {13},
     number = {3},
     year = {1979},
     mrnumber = {554682},
     zbl = {0424.68042},
     language = {fr},
     url = {http://archive.numdam.org/item/ITA_1979__13_3_203_0/}
}
TY  - JOUR
AU  - Boasson, L.
TI  - Un langage algébrique particulier
JO  - RAIRO. Informatique théorique
PY  - 1979
SP  - 203
EP  - 215
VL  - 13
IS  - 3
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1979__13_3_203_0/
LA  - fr
ID  - ITA_1979__13_3_203_0
ER  - 
%0 Journal Article
%A Boasson, L.
%T Un langage algébrique particulier
%J RAIRO. Informatique théorique
%D 1979
%P 203-215
%V 13
%N 3
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1979__13_3_203_0/
%G fr
%F ITA_1979__13_3_203_0
Boasson, L. Un langage algébrique particulier. RAIRO. Informatique théorique, Tome 13 (1979) no. 3, pp. 203-215. http://archive.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

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

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

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

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

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

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

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

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

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

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