{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T22:52:23Z","timestamp":1648939943759},"reference-count":30,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO. Inform. th\u00e9or."],"published-print":{"date-parts":[[1977]]},"DOI":"10.1051\/ita\/1977110100291","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T15:31:11Z","timestamp":1486395071000},"page":"29-51","source":"Crossref","is-referenced-by-count":30,"title":["C\u00f4nes rationnels commutativement clos"],"prefix":"10.1051","volume":"11","author":[{"given":"Michel","family":"Latteux","sequence":"first","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. BAKER B. S. et BOOK R. V., Reversal-Bounded Multipushdown Machines, J. Comp. Syst. Sc., vol. 8, 1974, p. 315-332.3758440309.68043","DOI":"10.1016\/S0022-0000(74)80027-9"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. BERSTEL J., Une hi\u00e9rarchie des parties rationnelles de N2, Math. Systems Theory, vol. 7, 1973, p. 114-137.3318720257.68078","DOI":"10.1007\/BF01762231"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. BERSTEL J. et BOASSON L., Une suite d\u00e9croissante de c\u00f4nes rationnels, Institut de Programmation, Paris, n\u00b0 I. P. 74-75, 1974.0288.68037451876","DOI":"10.1007\/978-3-662-21545-6_29"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. BOASSON L., Two Iteration Theorems for Some Families of Languages, J. Comp. Syst. Sc., vol. 7, 1973, p. 583-596.3863520298.68053","DOI":"10.1016\/S0022-0000(73)80036-4"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. BOASSON L. et NIVAT M., Sur diverses familles de langages ferm\u00e9es par transduction rationnelle, Acta Informatica, vol. 2, 1973, p. 180-188.3318730242.68037","DOI":"10.1007\/BF00264030"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. BOOK R. V. et GREIBACH S. A., Quasi-Realtime Languages, Math. Systems Theory, vol. 4, 1970, p. 97-111.2760190188.33102","DOI":"10.1007\/BF01705890"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. BOOK R. V., NIVAT M. et PATERSON M., 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.0361.68105","DOI":"10.1145\/800119.803906"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. DURIEUX J. L., Sur l'image, par une transduction rationnelle, des mots sur une lettre, R.A.I.R.O., R-2, 1975, p. 25-37.92018395348","DOI":"10.1051\/ita\/197509R200251"},{"key":"R9","unstructured":"9. EILENBERG S., Communication au Congr\u00e8s international des Math\u00e9maticiens, Nice, 1970."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"10. EILENBERG S. et SCHUTZENBERGER M. P., Rational Sets in Commutative Monoids, J. Algebra, vol. 13, 1969, p. 173-191.2469850206.02703","DOI":"10.1016\/0021-8693(69)90070-2"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"11. FISCHER M. J. et ROSENBERG A. L., Real-Time Solutions of the Origin-Crossing Problem, Math. Systems theory, vol. 2, 1968, p. 257-263.2359310181.01601","DOI":"10.1007\/BF01694010"},{"key":"R12","unstructured":"12. GINSBURG S., The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966.2118150184.28401"},{"key":"R13","unstructured":"13. GINSBURG S., Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland Publishing Company, 1975.4434460325.68002"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"14. GINSBURG S. et GOLDSTINE J., Intersection-Closed Full AFL and the Recursively Enumerable Languages, Information and Control, vol. 22, 1973, p. 201-231.3270870267.68035","DOI":"10.1016\/S0019-9958(73)90274-X"},{"key":"R15","unstructured":"15. GINSBURG S. et GREIBACH S. A., Studies in Abstract Families of Languages, Memoirs of the Amer. Math. Soc., vol. 113, 1966, p. 285-396."},{"key":"R16","doi-asserted-by":"crossref","unstructured":"16. GINSBURG S. et GREIBACH S. A., Principal AFL, J. Comp. Syst. Sc., vol. 4, 1970, p. 308-338.2865990198.03102","DOI":"10.1016\/S0022-0000(70)80016-2"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"17. GINSBURG S. et GREIBACH S. A., Multitape AFA, J. A.C.M., vol. 19, 1972, p. 193-221.3008280241.68031","DOI":"10.1145\/321694.321695"},{"key":"R18","doi-asserted-by":"crossref","unstructured":"18. GINSBURG S. et SPANIER E. M., Bounded Algol-like Languages, Trans. Amer. Math. Soc., vol. 113, 1964, p. 333-368.1815000142.24803","DOI":"10.2307\/1994067"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"19. GINSBURG S. et SPANIER E. M., AFL with the Semilinear Property, J. Comp. Syst. Sc., vol. 5, 1971, p. 365-396.3395580235.68029","DOI":"10.1016\/S0022-0000(71)80024-7"},{"key":"R20","doi-asserted-by":"crossref","unstructured":"20. GOLDSTINE J., Substitution and Bounded Languages, J. Comp. Syst. Sc., vol. 6, 1972, p. 9-29.3093670232.68030","DOI":"10.1016\/S0022-0000(72)80038-2"},{"key":"R21","doi-asserted-by":"crossref","unstructured":"21. GREIBACH S. A., Chains of Full AFL's, Math. Systems theory, vol. 4, 1970, p. 231-242.3293240203.30102","DOI":"10.1007\/BF01691106"},{"key":"R22","doi-asserted-by":"crossref","unstructured":"22. GREIBACH S. A., Simple Syntactic Operators on Full Semi-AFL's, J. Comp. Syst. Sc., vol. 6, 1972, p. 30-76.3075350269.68046","DOI":"10.1016\/S0022-0000(72)80039-4"},{"key":"R23","doi-asserted-by":"crossref","unstructured":"23. GREIBACH S. A., One Counter Language and the IRS Condition, J. Comp. Syst. Sc., vol. 10, 1975, p. 237-247.3953520307.68062","DOI":"10.1016\/S0022-0000(75)80042-0"},{"key":"R24","doi-asserted-by":"crossref","unstructured":"24. ITO R., Every Semilinear Set is a Finite Union of Disjoint Linear Sets, J. Comp. Syst. Sc., vol. 3, 1969, p. 221-231.2428510187.28503","DOI":"10.1016\/S0022-0000(69)80014-0"},{"key":"R25","unstructured":"25. LATTEUX M., Sur les semilin\u00e9aires-langages born\u00e9s, Publication n\u00b0 60 du Laboratoire de Calcul de l'Universit\u00e9 de Lille I, 1975."},{"key":"R26","doi-asserted-by":"crossref","unstructured":"26. LIU L. Y. et WEINER P., A Characterization of Semilinear Sets, J. Comp. Syst. Sc., vol. 4, 1970, p. 399-307.2694480231.68025","DOI":"10.1016\/S0022-0000(70)80015-0"},{"key":"R27","doi-asserted-by":"crossref","unstructured":"27. LIU L. Y. et WEINER P., An Infinite Hierarchy of Intersections of Context-Free Languages, Math. System Theory, vol. 7, 1973, p. 185-192.3213660257.68077","DOI":"10.1007\/BF01762237"},{"key":"R28","doi-asserted-by":"crossref","unstructured":"28. NIVAT M., Transduction des langages de Chomsky, Ann. Inst. Fourier, Grenoble, vol. 18, 1968, p. 339-455.739502386330313.68065","DOI":"10.5802\/aif.287"},{"key":"R29","unstructured":"29. PARIKH R. J., Language Generating Devices, M.I.T. Res. Lab. Electron. Quart. Prog. Rept., vol. 60, 1961, p. 199-212."},{"key":"R30","doi-asserted-by":"crossref","unstructured":"30. ROVAN B., Proving Containment of Bounded AFL, J. Comp. Syst. Sc., vol. 11, 1975, p.1-55.3838500338.68053","DOI":"10.1016\/S0022-0000(75)80048-1"}],"container-title":["RAIRO. Informatique th\u00e9orique"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1977110100291\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T09:33:13Z","timestamp":1568799193000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1977110100291"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"references-count":30,"journal-issue":{"issue":"1"},"alternative-id":["ita1977110100291"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1977110100291","relation":{},"ISSN":["0399-0540"],"issn-type":[{"value":"0399-0540","type":"print"}],"subject":[],"published":{"date-parts":[[1977]]}}}