{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:50:54Z","timestamp":1725663054305},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540167617"},{"type":"electronic","value":"9783540398592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16761-7_75","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:51:41Z","timestamp":1330177901000},"page":"254-264","source":"Crossref","is-referenced-by-count":14,"title":["On recognizable subsets of free partially commutative monoids"],"prefix":"10.1007","author":[{"given":"Y.","family":"Metivier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"27_CR1","unstructured":"I.J.J.AALBERSBERG, G.ROZENBERG, Trace Theory \u2014 a survey, Technical report, Inst. of Appl. Math. and Comp. Sci., University of Leiden, (1985)."},{"key":"27_CR2","unstructured":"A.V.ANISIMOV, D.KNUTH, Inhomogeneous sorting, unpublished manuscript."},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"J.BERSTEL, Transductions and Context-Free Languages. Teubner, (1979).","DOI":"10.1007\/978-3-663-09367-1"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"A.BERTONI, G.MAURI and N.SABADINI, equivalence and membership problems for regular trace languages, Proc. of the 9th ICALP 1982, Lecture Notes in Computer Sci. 140, Springer, (1982), 61\u201371.","DOI":"10.1007\/BFb0012757"},{"key":"27_CR5","volume-title":"Lecture Notes in Mathematics 85","author":"P. Cartier","year":"1969","unstructured":"P. CARTIER et D. FOATA, Probl\u00e8mes combinatoires de commutation et de r\u00e9arrangements, in: Lecture Notes in Mathematics 85, (Springer, Berlin, 1969)."},{"key":"27_CR6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1051\/ita\/1985190100211","volume":"19","author":"R. Cori","year":"1985","unstructured":"R. CORI et D. PERRIN, sur la reconnaissabilit\u00e9 dans les mono\u012bdes partiellement commutatifs libres, RAIRO Inform. Th\u00e9or. vol. 19, (1985), 21\u201332.","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"27_CR7","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 et Y. METIVIER, Recognizable subsets of partially abelian monoids, Theoret. Comput. Sci. 35, (1985), 179\u2013189.","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(85)90206-3","volume":"38","author":"M.P. Fle","year":"1985","unstructured":"M.P. FLE and G. ROUCAIROL, Maximal serializability of iterated transactions, Theoret. Comput. Sci. 38, (1985),1\u201316.","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR9","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1983","unstructured":"M. LOTHAIRE, Combinatorics on Words (Addison-Wesley, Reading MA, 1983)."},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"R.Mc NAUGHTON and H.YAMADA, Regular expressions and state graphs for automata, IRE Trans. On Electric Computers, EC-9 (1960).","DOI":"10.1109\/TEC.1960.5221603"},{"key":"27_CR11","unstructured":"Y.METIVIER, Une condition suffisante de reconnaissabilit\u00e9 dans un mono\u012bde partiellement commutatif, (soumis \u00e0 RAIRO Inform. Th\u00e9o.)."},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"D.PERRIN, Words over a partially commutative alphabet, in: Combinatorial Algorithms on Words, Ed.: A. Apostolico and Z. Galil, NATO ASI-Series. Vol. F12, Springer, (1985).","DOI":"10.1007\/978-3-642-82456-2_23"},{"key":"27_CR13","unstructured":"E.OCHMANSKI, Regular behaviour of concurrent systems, in:EATCS Bulletin, (October 1985)."},{"key":"27_CR14","unstructured":"G.VIENNOT, Empilement et commutation: th\u00e9orie combinatoire et applications, Proc. Colloque de combinatoire \u00e9num\u00e9rative, Montr\u00e9al 1985, \u00e0 para\u00eetre Lecture Notes in Math."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16761-7_75.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:10:55Z","timestamp":1605625855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16761-7_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167617","9783540398592"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-16761-7_75","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}