Cônes rationnels commutativement clos
RAIRO. Informatique théorique, Volume 11 (1977) no. 1, pp. 29-51.
@article{ITA_1977__11_1_29_0,
     author = {Latteux, Michel},
     title = {C\^ones rationnels commutativement clos},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {29--51},
     publisher = {Centrale des revues, Dunod-Gauthier-Villars},
     address = {Montreuil},
     volume = {11},
     number = {1},
     year = {1977},
     mrnumber = {478782},
     zbl = {0354.68103},
     language = {fr},
     url = {http://www.numdam.org/item/ITA_1977__11_1_29_0/}
}
TY  - JOUR
AU  - Latteux, Michel
TI  - Cônes rationnels commutativement clos
JO  - RAIRO. Informatique théorique
PY  - 1977
SP  - 29
EP  - 51
VL  - 11
IS  - 1
PB  - Centrale des revues, Dunod-Gauthier-Villars
PP  - Montreuil
UR  - http://www.numdam.org/item/ITA_1977__11_1_29_0/
LA  - fr
ID  - ITA_1977__11_1_29_0
ER  - 
%0 Journal Article
%A Latteux, Michel
%T Cônes rationnels commutativement clos
%J RAIRO. Informatique théorique
%D 1977
%P 29-51
%V 11
%N 1
%I Centrale des revues, Dunod-Gauthier-Villars
%C Montreuil
%U http://www.numdam.org/item/ITA_1977__11_1_29_0/
%G fr
%F ITA_1977__11_1_29_0
Latteux, Michel. Cônes rationnels commutativement clos. RAIRO. Informatique théorique, Volume 11 (1977) no. 1, pp. 29-51. http://www.numdam.org/item/ITA_1977__11_1_29_0/

1. B. S. Baker et R. V. Book, Reversal-Bounded Multipushdown Machines, J. Comp. Syst. Sc., vol. 8, 1974, p. 315-332. | MR | Zbl

2. J. Berstel, Une hiérarchie des parties rationnelles de N2, Math. Systems Theory, vol. 7, 1973, p. 114-137. | MR | Zbl

3. J. Berstel et L. Boasson, Une suite décroissante de cônes rationnels, Institut de Programmation, Paris, n° I. P. 74-75, 1974. | MR

4. L. Boasson, Two Iteration Theorems for Some Families of Languages, J. Comp. Syst. Sc., vol. 7, 1973, p. 583-596. | MR | Zbl

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

6. R. V. Book et S. A. Greibach, Quasi-Realtime Languages, Math. Systems Theory, vol. 4, 1970, p. 97-111. | MR | Zbl

7. R. V. Book, M. Nivat et M. Paterson, Intersections of Linear Context-Free Languages and Reversal-Bounded Multipushdown Machines, Proceedings of 6th annual A.C.M. Symphosium on theory of Computing, 1974, p. 290-296. | Zbl

8. J. L. Durieux, Sur l'image, par une transduction rationnelle, des mots sur une lettre, R.A.I.R.O., R-2, 1975, p. 25-37. | Numdam | MR

9. S. Eilenberg, Communication au Congrès international des Mathématiciens, Nice, 1970.

10. S. Eilenberg et M. P. Schutzenberger, Rational Sets in Commutative Monoids, J. Algebra, vol. 13, 1969, p. 173-191. | MR | Zbl

11. M. J. Fischer et A. L. Rosenberg, Real-Time Solutions of the Origin-Crossing Problem, Math. Systems theory, vol. 2, 1968, p. 257-263. | MR | Zbl

12. S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966. | MR | Zbl

13. S. Ginsburg, Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland Publishing Company, 1975. | MR | Zbl

14. S. Ginsburg et J. Goldstine, Intersection-Closed Full AFL and the Recursively Enumerable Languages, Information and Control, vol. 22, 1973, p. 201-231. | MR | Zbl

15. S. Ginsburg et S. A. Greibach, Studies in Abstract Families of Languages, Memoirs of the Amer. Math. Soc., vol. 113, 1966, p. 285-396.

16. S. Ginsburg et S. A. Greibach, Principal AFL, J. Comp. Syst. Sc., vol. 4, 1970, p. 308-338. | MR | Zbl

17. S. Ginsburg et S. A. Greibach, Multitape AFA, J. A.C.M., vol. 19, 1972, p. 193-221. | MR | Zbl

18. S. Ginsburg et E. M. Spanier, Bounded Algol-like Languages, Trans. Amer. Math. Soc., vol. 113, 1964, p. 333-368. | MR | Zbl

19. S. Ginsburg et E. M. Spanier, AFL with the Semilinear Property, J. Comp. Syst. Sc., vol. 5, 1971, p. 365-396. | MR | Zbl

20. J. Goldstine, Substitution and Bounded Languages, J. Comp. Syst. Sc., vol. 6, 1972, p. 9-29. | MR | Zbl

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

22. S. A. Greibach, Simple Syntactic Operators on Full Semi-AFL's, J. Comp. Syst. Sc., vol. 6, 1972, p. 30-76. | MR | Zbl

23. S. A. Greibach, One Counter Language and the IRS Condition, J. Comp. Syst. Sc., vol. 10, 1975, p. 237-247. | MR | Zbl

24. R. Ito, Every Semilinear Set is a Finite Union of Disjoint Linear Sets, J. Comp. Syst. Sc., vol. 3, 1969, p. 221-231. | MR | Zbl

25. M. Latteux, Sur les semilinéaires-langages bornés, Publication n° 60 du Laboratoire de Calcul de l'Université de Lille I, 1975.

26. L. Y. Liu et P. Weiner, A Characterization of Semilinear Sets, J. Comp. Syst. Sc., vol. 4, 1970, p. 399-307. | MR | Zbl

27. L. Y. Liu et P. Weiner, An Infinite Hierarchy of Intersections of Context-Free Languages, Math. System Theory, vol. 7, 1973, p. 185-192. | MR | Zbl

28. M. Nivat, Transduction des langages de Chomsky, Ann. Inst. Fourier, Grenoble, vol. 18, 1968, p. 339-455. | Numdam | MR | Zbl

29. R. J. Parikh, Language Generating Devices, M.I.T. Res. Lab. Electron. Quart. Prog. Rept., vol. 60, 1961, p. 199-212.

30. B. Rovan, Proving Containment of Bounded AFL, J. Comp. Syst. Sc., vol. 11, 1975, p.1-55. | MR | Zbl