{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:24:04Z","timestamp":1725456244687},"publisher-location":"Berlin\/Heidelberg","reference-count":61,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354051516X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0015926","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T06:25:05Z","timestamp":1132727105000},"page":"37-54","source":"Crossref","is-referenced-by-count":3,"title":["Rational cones and commutations"],"prefix":"10.1007","author":[{"given":"Michel","family":"Latteux","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"IJ.J.Aalbersberg and G.Rozenberg, Theory of traces, Tech.Rep., University of Leiden, 1986."},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1051\/ita\/1986200201031","volume":"20","author":"IJ.J. Aalbersberg","year":"1986","unstructured":"IJ.J. Aalbersberg and E. Welzl, Trace languages defined by regular string languages, RAIRO Inform.Theor. 20(1986) 103\u2013119.","journal-title":"RAIRO Inform.Theor."},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/B978-0-12-115350-2.50009-9","volume-title":"Formal Language Theory, Perspective and Open Problems","author":"J.M. Autebert","year":"1980","unstructured":"J.M. Autebert, J. Beauquier, L. Boasson and M. Latteux, Very small families of languages, in R.V. Book,ed., Formal Language Theory, Perspective and Open Problems (Academic Press, New York,1980) 89\u2013107."},{"key":"4_CR4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/S0019-9958(81)90588-X","volume":"48","author":"J.M. Autebert","year":"1981","unstructured":"J.M. Autebert, J. Beauquier, L. Boasson and M. Latteux, Languages alg\u00e9briques domin\u00e9s par des languages unaires, Information and Control 48(1981) 49\u201353.","journal-title":"Information and Control"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"J.Beauquier, M.Blattner and M.Latteux, On commutative context-free languages, J.of Comput. and Syst.Sc. 35(1987).","DOI":"10.1016\/0022-0000(87)90018-3"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"J.Berstel,Transductions and Context-Free Languages (Teubner,1979).","DOI":"10.1007\/978-3-663-09367-1"},{"key":"4_CR7","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BFb0016231","volume":"233","author":"J. Berstel","year":"1986","unstructured":"J. Berstel and J. Sakarovich, Recent results in the theory of rational sets, Lect.Notes in Comp.Sci. 233(1986) 15\u201328.","journal-title":"Lect.Notes in Comp.Sci."},{"key":"4_CR8","unstructured":"A.Bertoni, G.Mauri and N.Sabadini, Unambiguous regular trace languages, in J.Demetrovics, G.Katona and A.Salomaa, eds., Algebra, Combinatorics and Logic in Computer Science (North Holland, 1985)."},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/3-540-10843-2_26","volume":"115","author":"M. Blattner","year":"1981","unstructured":"M. Blattner and M. Latteux, Parikh-bounded languages, Lect.Notes in Comp.Sci. 115(1981) 316\u2013323.","journal-title":"Lect.Notes in Comp.Sci."},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/0022-0000(79)90004-7","volume":"19","author":"R.V. Book","year":"1979","unstructured":"R.V. Book, S. Greibach and C. Wrathall, Reset machines, J.of Comput. and Syst.Sc. 19(1979) 256\u2013276.","journal-title":"J.of Comput. and Syst.Sc."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"P.Cartier and D.Foata, Probl\u00e8mes combinatoires de commutations et r\u00e9arrangements, Lect. Notes in Math. 85(1969).","DOI":"10.1007\/BFb0079468"},{"key":"4_CR12","unstructured":"M.Clerbout, Commutations partielles et familles de langages, Thesis, University of Lille, 1984."},{"key":"4_CR13","unstructured":"M.Clerbout, Compositions de fonctions de commutation partielle, to appear in RAIRO Inform.Theor., 1986."},{"key":"4_CR14","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0304-3975(84)90053-7","volume":"34","author":"M. Clerbout","year":"1984","unstructured":"M. Clerbout and M. Latteux, Partial commutations and faithful rational transductions, Theoretical Computer Science 34(1984) 241\u2013254.","journal-title":"Theoretical Computer Science"},{"key":"4_CR15","unstructured":"M.Clerbout and M.Latteux, On a generalization of partial commutations, in: M.Arato, I.Katai, L.Varga, eds, Proc.Fourth Hung. Computer Sci.Conf. (1985) 15\u201324."},{"key":"4_CR16","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0890-5401(87)90040-X","volume":"73","author":"M. Clerbout","year":"1987","unstructured":"M. Clerbout and M. Latteux, Semi-commutations, Information and Computation 73(1987) 59\u201374.","journal-title":"Information and Computation"},{"key":"4_CR17","unstructured":"M.Clerbout and Y.Roos, Semi-communtations algebrico-rationnelles, Tech. Rep. no 126-88, University of Lille, 1988."},{"key":"4_CR18","unstructured":"M.Clerbout and Y.Roos, Semi-commutations et languages alg\u00e9briques, Tech.Rep. no 129-88, University of Lille, 1988."},{"key":"4_CR19","unstructured":"R.Cori, Partially abelian monoids, Invited lecture, STACS, Orsay, 1986."},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"R.Cori, M.Latteux, Y.Roos and E.Sopena, 2-asynchronous automata, to appear in Theoretical Computer Science, 1987.","DOI":"10.1016\/0304-3975(88)90110-7"},{"key":"4_CR21","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0304-3975(85)90013-1","volume":"38","author":"R. Cori","year":"1985","unstructured":"R. Cori and Y. Metivier, Recognizable subsets of partially abelian monoids, Theoretical Computer Science 38(1985) 179\u2013189.","journal-title":"Theoretical Computer Science"},{"key":"4_CR22","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1051\/ita\/1985190100211","volume":"19","author":"R. Cori","year":"1985","unstructured":"R. Cori and D. Perrin, Automates et commutations partielles, RAIRO Inform.Theor. 19(1985) 21\u201332.","journal-title":"RAIRO Inform.Theor."},{"key":"4_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(85)90121-8","volume":"20","author":"C. Duboc","year":"1985","unstructured":"C. Duboc, Some properties of commutation in free partially commutative monoids, Inform.Proc.Letters 20(1985) 1\u20134.","journal-title":"Inform.Proc.Letters"},{"key":"4_CR24","unstructured":"C.Duboc, Commutations dans les mono\u00efdes libres: un cadre th\u00e9orique pour l'\u00e9tude du parall\u00e9lisme, Thesis, University of Rouen, 1986."},{"key":"4_CR25","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BFb0012768","volume":"140","author":"A. Ehrenfeucht","year":"1982","unstructured":"A. Ehrenfeucht, D. Haussler and G. Rozenberg, Conditions enforcing regularity of context-free languages, Lect.Notes in Comp.Sci. 140(1982) 187\u2013191.","journal-title":"Lect.Notes in Comp.Sci."},{"key":"4_CR26","first-page":"344","volume":"13","author":"S. Eilenberg","year":"1969","unstructured":"S. Eilenberg and M.P. Sch\u00fctzenberger, Rational sets in commutative monoids, J. of Algebra 13(1969) 344\u2013353.","journal-title":"J. of Algebra"},{"key":"4_CR27","volume-title":"The Mathematical Theory of Context-Free Languages","author":"S. Ginsburg","year":"1966","unstructured":"S. Ginsburg, The Mathematical Theory of Context-Free Languages (McGraw-Hill, New York,1966)."},{"key":"4_CR28","volume-title":"Algebraic and Automata-Theoretic Properties of Formal Languages","author":"S. Ginsburg","year":"1975","unstructured":"S. Ginsburg, Algebraic and Automata-Theoretic Properties of Formal Languages (North Holland, Amsterdam, 1975)."},{"key":"4_CR29","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S. Ginsburg","year":"1966","unstructured":"S. Ginsburg and E.H. Spanier, Semigroups, Preburger formulas and languages, Pacif.J.Math. 16(1966) 285\u2013296.","journal-title":"Pacif.J.Math."},{"key":"4_CR30","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0022-0000(71)80024-7","volume":"5","author":"S. Ginsburg","year":"1971","unstructured":"S. Ginsburg and E.H. Spanier, AFL with the semilinear property, J.of Comput. and Syst.Sc. 5(1971) 365\u2013396.","journal-title":"J.of Comput. and Syst.Sc."},{"key":"4_CR31","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0304-3975(85)90059-3","volume":"41","author":"P. Gohon","year":"1985","unstructured":"Ph. Gohon, An algorithm to decide whether a rational subset of Nk is recognizable, Theoretical Computer Science 41(1985) 51\u201359.","journal-title":"Theoretical Computer Science"},{"key":"4_CR32","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0020-0190(83)90053-4","volume":"17","author":"A.K. Joshi","year":"1983","unstructured":"A.K. Joshi and T. Yokomori, Semi-linearity,Parikh-boundedness and tree adjunct languages, Inform.Proc.Letters 17(1983) 137\u2013143.","journal-title":"Inform.Proc.Letters"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"J. Kortelainen, On language families generated by commutative languages, Ph.D. Thesis, University of Oulu, 1982.","DOI":"10.1007\/3-540-10854-8_23"},{"key":"4_CR34","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0166-218X(82)90045-2","volume":"4","author":"J. Kortelainen","year":"1982","unstructured":"J. Kortelainen, A result concerning the trio generated by commutative slip-languages, Discrete Applied Mathematics 4(1982) 233\u2013236.","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR35","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1051\/ita\/1986200303191","volume":"20","author":"J. Kortelainen","year":"1986","unstructured":"J. Kortelainen, Every commutative quasirational language is regular, RAIRO Inform.Theor. 20(1986) 319\u2013337.","journal-title":"RAIRO Inform.Theor."},{"key":"4_CR36","doi-asserted-by":"crossref","unstructured":"J.Kortelainen, The conjecture of Fliess on commutative context-free languages,to appear, 1988.","DOI":"10.1145\/76359.76367"},{"key":"4_CR37","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1051\/ita\/1977110100291","volume":"11","author":"M. Latteux","year":"1977","unstructured":"M. Latteux, Cones rationnels commutativement clos, RAIRO Inform.Theor.11(1977) 29\u201351.","journal-title":"RAIRO Inform.Theor."},{"key":"4_CR38","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0022-0000(79)90039-4","volume":"18","author":"M. Latteux","year":"1979","unstructured":"M. Latteux, cones rationnels commutatifs, J.of Comput. and Syst.Sc. 18(1979) 307\u2013333.","journal-title":"J.of Comput. and Syst.Sc."},{"key":"4_CR39","unstructured":"M. Latteux, Languages commutatifs, transductions rationnelles et intersection, in M.Blab ed., Actes de l'\u00e9cole de printemps de th\u00e9orie des langages (Tech.Rep.82-14, LITP, 1982) 235\u2013242."},{"key":"4_CR40","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01699459","volume":"18","author":"M. Latteux","year":"1985","unstructured":"M. Latteux and J. Leguy, On the usefulness of bifaifhful rational cones, Math.Systems Theory 18(1985) 19\u201332.","journal-title":"Math.Systems Theory"},{"key":"4_CR41","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/0022-0000(84)90013-8","volume":"29","author":"M. Latteux","year":"1984","unstructured":"M. Latteux and G. Rozenberg, Commutative one-couter languages are regular, J.of Comput. and Syst.Sc. 29(1984) 54\u201357.","journal-title":"J.of Comput. and Syst.Sc."},{"key":"4_CR42","first-page":"61","volume":"10","author":"M. Latteux","year":"1984","unstructured":"M. Latteux and G. Thierrin, Codes and commutative star languages, Soochow J.of Math. 10(1984) 61\u201371.","journal-title":"Soochow J.of Math."},{"key":"4_CR43","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(71)90013-5","volume":"1","author":"H.A. Maurer","year":"1971","unstructured":"H.A. Maurer, The solution of a problem by Ginsburg, Inform.Process.Lett. 1(1971) 7\u201310.","journal-title":"Inform.Process.Lett."},{"key":"4_CR44","doi-asserted-by":"crossref","unstructured":"A.Mazurkiewicz, Concurrent program schemes and their interpretations, DAIMI PB 78, University of Aarhus, 1977.","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"4_CR45","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BFb0030293","volume":"176","author":"A. Mazurkiewicz","year":"1984","unstructured":"A. Mazurkiewicz, Traces, histories and graphs: instances of process monoids, Lect.Notes in Comp.Sci. 176(1984) 115\u2013133.","journal-title":"Lect.Notes in Comp.Sci."},{"key":"4_CR46","unstructured":"Y.Metivier, Semi commutations dans le mono\u00efde libre,Tech. Rep. n0 I-8606, University of Bordeaux, 1986."},{"key":"4_CR47","unstructured":"Y.Metivier, Contribution \u00e0 l'\u00e9tude des mono\u00efdes de commutations,Th\u00e8se d'\u00e9tat,University of Bordeaux, 1987."},{"key":"4_CR48","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/3-540-16761-7_75","volume":"226","author":"Y. Metivier","year":"1986","unstructured":"Y. Metivier, On recognizable subsets of free partially commutative monoids, Lect.Notes in Comp.Sci. 226(1986) 254\u2013264.","journal-title":"Lect.Notes in Comp.Sci."},{"key":"4_CR49","first-page":"56","volume":"27","author":"E. Ochmanski","year":"1985","unstructured":"E. Ochmanski, Regular behaviour of concurrent systems, Bulletin of EATCS 27(1985) 56\u201367.","journal-title":"Bulletin of EATCS"},{"key":"4_CR50","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/S0019-9958(72)90821-2","volume":"20","author":"T. Oshiba","year":"1972","unstructured":"T. Oshiba, On permutting letters of words in context-free languages, Information and Control 20(1972) 405\u2013409.","journal-title":"Information and Control"},{"key":"4_CR51","doi-asserted-by":"crossref","unstructured":"D.Perrin, Words over a partially commutative alphabet, NATO ASI Series F12,Springer (1985) 329\u2013340.","DOI":"10.1007\/978-3-642-82456-2_23"},{"key":"4_CR52","first-page":"597","volume":"265","author":"J.F. Perrot","year":"1967","unstructured":"J.F. Perrot, Sur la fermeture commutative des C-langages, C.R.Acad.Sci.Paris 265(1967) 597\u2013600.","journal-title":"C.R.Acad.Sci.Paris"},{"key":"4_CR53","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0304-3975(85)90156-2","volume":"40","author":"A. Restivo","year":"1985","unstructured":"A. Restivo and C. Reutenauer, Rational languages and the Burnside problem, Theoretical Computer Science 40(1985) 13\u201330.","journal-title":"Theoretical Computer Science"},{"key":"4_CR54","unstructured":"Y.Roos, Virtually asynchronous automata, Conference on Automata, Languages and Programming Systems, Salgotarjan, 1988."},{"key":"4_CR55","unstructured":"Y.Roos, Contribution \u00e0 l'\u00e9tude des fonctions de commutation partielle, Thesis, University of Lille, 1989."},{"key":"4_CR56","unstructured":"B.Rozoy, Un mod\u00e8le de parall\u00e9lisme: le mono\u00efde distribu\u00e9, Th\u00e8se d'\u00e9tat, University of Caen, 1987."},{"key":"4_CR57","unstructured":"J.Sakarovitch, On regular trace languages, to appear in RAIRO Inform.Theor."},{"key":"4_CR58","volume-title":"Theory of Automata","author":"A. Salomaa","year":"1969","unstructured":"A. Salomaa, Theory of Automata, (Pergamon Press, Oxford, 1969)."},{"key":"4_CR59","unstructured":"M.Szijarto, The closure of languages on a binary relation, IMYCS Conference, Smolenice,1982."},{"key":"4_CR60","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0020-0255(81)90039-6","volume":"23","author":"P. Turakainen","year":"1981","unstructured":"P. Turakainen, On some bounded semiAFLs and AFLs, Inform.Sci. 23(1981) 31\u201348.","journal-title":"Inform.Sci."},{"key":"4_CR61","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1051\/ita\/1987210200991","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"W. Zielonka, Notes on asynchronous automata, RAIRO Inform.Theor. 21(1987) 99\u2013135.","journal-title":"RAIRO Inform.Theor."}],"container-title":["Lecture Notes in Computer Science","Machines, Languages, and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0015926","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T15:35:53Z","timestamp":1683300953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015926"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354051516X"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/bfb0015926","relation":{},"subject":[]}}