{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:49Z","timestamp":1725456769493},"publisher-location":"Berlin\/Heidelberg","reference-count":20,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029610","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:33:46Z","timestamp":1133397226000},"page":"209-216","source":"Crossref","is-referenced-by-count":2,"title":["Decomposition of semi commutations"],"prefix":"10.1007","author":[{"given":"M.","family":"Clerbout","sequence":"first","affiliation":[]},{"given":"D.","family":"Gonzalez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","first-page":"1","volume":"60","author":"IJ.J. Aabersberg","year":"1986","unstructured":"IJ.J. Aabersberg & G. Rozenberg. Theory of Traces. Theorical Computer Science 60 (1986) 1\u201383.","journal-title":"Theorical Computer Science"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"J.Berstel. Transductions and Context-Free Languages. Teubner (1979).","DOI":"10.1007\/978-3-663-09367-1"},{"key":"19_CR3","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BFb0016231","volume":"233","author":"J. Berstel","year":"1986","unstructured":"J. Berstel & J. Sakarovich. Recents results in the theory of rational sets. Lect. Notes in Comp.Sci. 233 (1986) 15\u201328.","journal-title":"Lect. Notes in Comp.Sci."},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"P.Cartier & D.Foata. Probl\u00e8mes combinatoires de commutations et r\u00e9arrangements. Lect. Notes in Math. 85 (1969).","DOI":"10.1007\/BFb0079468"},{"key":"19_CR5","unstructured":"M.Clerbout. Commutations partielles et familles de langages. Th\u00e8se, Universit\u00e9 de Lille (1984)."},{"key":"19_CR6","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1051\/ita\/1989230403951","volume":"23","author":"M. Clerbout","year":"1989","unstructured":"M. Clerbout, Compositions de fonctions de commutation partielle. RAIRO Informatique Th\u00e9orique et Applications 23 (1989) 395\u2013424.","journal-title":"RAIRO Informatique Th\u00e9orique et Applications"},{"key":"19_CR7","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 & M. Latteux. Partial commutations and faithful rational transductions. Theoretical Computer Science 34 (1984) 241\u2013254.","journal-title":"Theoretical Computer Science"},{"key":"19_CR8","unstructured":"M.Clerbout & M.Latteux. On a generalization of partial commutations. in M.Arato, I.Katai, L.varga, eds, Prc.Fourth Hung. Computer Sci.Conf (1985) 15\u201324."},{"key":"19_CR9","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 & M. Latteux. Semi-commutations. Information and Computation 73 (1987) 59\u201374.","journal-title":"Information and Computation"},{"key":"19_CR10","unstructured":"M.Clerbout, M.Latteux & Y.Roos, Decomposition of partial commutations, Publication interne LIFL, Universit\u00e9 de Lille, IT173 (1989) and ICALP'90."},{"key":"19_CR11","unstructured":"R.Cori. Partially abelian monoids. Invited lecture, STACS, Orsay (1986)."},{"key":"19_CR12","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1051\/ita\/1985190100211","volume":"19","author":"R. Cori","year":"1985","unstructured":"R. Cori & D. Perrin. Automates et commutations partielles. RAIRO Inform. Theor. 19 (1985) 21\u201332.","journal-title":"RAIRO Inform. Theor."},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"M.Latteux, Rational cones and commutations. Machines, Languages and Complexity. J.Dassow and J.Kelemen eds., Lect. Notes in Comp.Sci. (1989) 37\u201354.","DOI":"10.1007\/BFb0015926"},{"key":"19_CR14","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":"19_CR15","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":"19_CR16","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":"19_CR17","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":"19_CR18","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":"19_CR19","unstructured":"Y.Roos. Contribution \u00e0 l'\u00e9tude des fonctions de commutations partielles. Th\u00e8se, Universit\u00e9 de Lille (1989)."},{"key":"19_CR20","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","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029610","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:16:02Z","timestamp":1586578562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029610"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0029610","relation":{},"subject":[]}}