{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:18Z","timestamp":1725663678564},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540577850"},{"type":"electronic","value":"9783540483328"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57785-8_153","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:19:46Z","timestamp":1330244386000},"page":"339-352","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the star operation and the finite power property in free partially commutative monoids"],"prefix":"10.1007","author":[{"given":"Yves","family":"M\u00e9tivier","sequence":"first","affiliation":[]},{"given":"Gw\u00e9na\u00cbl","family":"Richomme","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"P. Cartier and D. Foata, Probl\u00e8mes combinatoires de commutation et r\u00e9arrangements, Lecture Notes in Math. 85, 1969.","DOI":"10.1007\/BFb0079468"},{"key":"27_CR2","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0304-3975(85)90013-1","volume":"35","author":"R. Cori","year":"1985","unstructured":"R. Cori and Y. M\u00e9tivier, Recognizable subsets of some partially abelian monoids, Theoret. Comput. Sci. 35, p179\u2013189, 1985.","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR3","first-page":"21","volume":"19","author":"R. Cori","year":"1985","unstructured":"R. Cori and D. Perrin, Automates et commutations partielles, Sur la reconnaissabilit\u00e9 dans les mono\u00cfdes partiellement comutatif libres, RAIRO, Theoretical Informatics and Applications 19, p 21\u201332, 1985.","journal-title":"RAIRO, Theoretical Informatics and Applications"},{"key":"27_CR4","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0304-3975(86)90028-9","volume":"46","author":"C. Duboc","year":"1986","unstructured":"C. Duboc, On some equations in free partially commutative monoids, Theoret. Comput. Sci. 46, p159\u2013174, 1986.","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR5","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1974","unstructured":"S. Eilenberg, Automata, Languages and Machines, Academic Press, New York, 1974."},{"key":"27_CR6","first-page":"197","volume":"53","author":"M. Fliess","year":"1974","unstructured":"M. Fliess, Matrices de Hankel, J. Math Pures et Appl. 53, p197\u2013224, 1974.","journal-title":"J. Math Pures et Appl."},{"key":"27_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(85)90206-3","volume":"38","author":"M.P. Fl\u00e9","year":"1985","unstructured":"M.P. Fl\u00e9 and G. Roucairol, Maximal seriazibility of iterated transactions, Theoret. Comput. Sci. 38, p1\u201316, 1985.","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR8","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0020-0190(92)90187-Z","volume":"44","author":"P. Gastin","year":"1992","unstructured":"P. Gastin, E. Ochma\u0144ski, A. Petit, B. Rozoy, Decidability of the Star Problem in A*\u00d7 {b}*, Inform. Process. Lett. 44, p65\u201371, 1992.","journal-title":"Inform. Process. Lett."},{"key":"27_CR9","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. Spanier, Semigroups, presburger formulas and languages, Pacific journal of mathematics 16, p285\u2013296, 1966.","journal-title":"Pacific journal of mathematics"},{"issue":"5","key":"27_CR10","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1090\/S0002-9939-1966-0201310-3","volume":"17","author":"S. Ginsburg","year":"1966","unstructured":"S. Ginsburg and E. Spanier, Bounded regular sets, Proceedings of the AMS, vol. 17(5), p1043\u20131049, 1966.","journal-title":"Proceedings of the AMS"},{"key":"27_CR11","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(79)90057-4","volume":"8","author":"K. Hashigushi","year":"1979","unstructured":"K. Hashigushi, A decision procedure for the order of regular events, Theoret. Comput. Sci. 8, p69\u201372, 1979.","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR12","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0022-0000(82)90051-4","volume":"24","author":"K. Hashigushi","year":"1982","unstructured":"K. Hashigushi, Limitedness Theorem on Finite Automata with Distance Functions, J. of Computer and System Science24, p233\u2013244, 1982.","journal-title":"J. of Computer and System Science"},{"key":"27_CR13","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0304-3975(91)90019-X","volume":"86","author":"K. Hashigushi","year":"1991","unstructured":"K. Hashigushi, Recognizable closures and submonoids of free partially commutative monoids, Theoret. Comput. Sci. 86, p233\u2013241, 1991.","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"M. Linna, Finite Power Property of regular languages, Automata, Languages and Programming, 1973.","DOI":"10.5186\/aasfm.1972.516"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"A. Mazurkiewicz, Concurrent program schemes and their interpretations, Aarhus university, DAIMI rep. PB 78, 1977.","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"27_CR16","first-page":"254","volume":"176","author":"A. Mazurkiewicz","year":"1984","unstructured":"A. Mazurkiewicz, Traces, Histories, Graphs: instances of a process monoid, Lecture Notes in Computer Science 176, p254\u2013264, 1984.","journal-title":"Lecture Notes in Computer Science"},{"key":"27_CR17","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1051\/ita\/1986200201211","volume":"20","author":"Y. M\u00e9tivier","year":"1986","unstructured":"Y. M\u00e9tivier, Une condition suffisante de reconnaissabilit\u00e9 dans un mono\u00cfde partiellement commutatif, RAIRO Theoretical Informatics and Applications 20, p121\u2013127, 1986.","journal-title":"RAIRO Theoretical Informatics and Applications"},{"key":"27_CR18","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0304-3975(88)90027-8","volume":"58","author":"Y. M\u00e9tivier","year":"1988","unstructured":"Y. M\u00e9tivier, On recognizable subset of free partially Commutative Monoids, Theoret. Comput. Sci. 58, p201\u2013208, 1988.","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR19","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1142\/S0129054191000169","volume":"2","author":"Y. M\u00e9tivier","year":"1991","unstructured":"Y. M\u00e9tivier and B. Rozoy, On the star operation in free partially commutative monoids, International Journal of Foundations of Computer Science 2, p257\u2013265, 1991.","journal-title":"International Journal of Foundations of Computer Science"},{"key":"27_CR20","unstructured":"Y. M\u00e9tivier and G. Richomme, On the star operation and the finite power property in free partially commutative monoid, Internal Report LaBRI-Universit\u00e9 Bordeaux I 93\u201315, 1993."},{"key":"27_CR21","first-page":"252","volume":"40","author":"E. Ochma\u0144ski","year":"1990","unstructured":"E. Ochma\u0144ski, Notes on a star mystery, Bulletin of EATCS 40, p252\u2013257, February 1990.","journal-title":"Bulletin of EATCS"},{"key":"27_CR22","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1007\/BFb0023848","volume":"583","author":"J. Sakarovitch","year":"1992","unstructured":"J. Sakarovitch, The \u201clast\u201d decision problem for rational trace languages, Proceedings of LATIN'92, Lecture Notes in Computer Science 583, p460\u2013473, 1992.","journal-title":"Lecture Notes in Computer Science"},{"key":"27_CR23","unstructured":"A. Salomaa, Jewels of formal languages theory, PITMAN eds."},{"key":"27_CR24","doi-asserted-by":"crossref","unstructured":"I. Simon, Limited subsets of a free monoid, Proceedings of th 19th FOCS, p143\u2013150, 1978.","DOI":"10.1109\/SFCS.1978.21"}],"container-title":["Lecture Notes in Computer Science","STACS 94"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57785-8_153","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T18:51:38Z","timestamp":1578509498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57785-8_153"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540577850","9783540483328"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-57785-8_153","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"31 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}