{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:04Z","timestamp":1725663844847},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571827"},{"type":"electronic","value":"9783540479277"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57182-5_25","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:10:00Z","timestamp":1330258200000},"page":"332-341","source":"Crossref","is-referenced-by-count":4,"title":["Speedup of recognizable trace languages"],"prefix":"10.1007","author":[{"given":"Christophe","family":"C\u00e9rin","sequence":"first","affiliation":[]},{"given":"Antoine","family":"Petit","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(88)90051-5","volume":"60","author":"I. J. Aalbersberg","year":"1988","unstructured":"I.J. Aalbersberg and G. Rozenberg. Theory of traces. Theoretical Computer Science, 60:1\u201382, 1988.","journal-title":"Theoretical Computer Science"},{"key":"25_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context Free Languages","author":"J. Berstel","year":"1979","unstructured":"J. Berstel. Transductions and Context Free Languages. Taubner, Stuttgart, 1979."},{"key":"25_CR3","unstructured":"C. C\u00e9rin. Application de la th\u00e9orie des traces \u00e0 l'implantation et \u00e0 la mesure d'algorithmes de distribution. Th\u00e8se, Universit\u00e9 de Paris-Sud, 1992."},{"key":"25_CR4","volume-title":"volume 85 of Lecture Notes in Mathematics","author":"P. Cartier","year":"1969","unstructured":"P. Cartier and D. Foata. Probl\u00e8mes combinatoires de commutation et r\u00e9arrangements, volume 85 of Lecture Notes in Mathematics. Springer, Berlin-Heidelberg-New York, 1969."},{"key":"25_CR5","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. R.A.I.R.O.-Informatique Th\u00e9orique et Applications, 19:21\u201332, 1985.","journal-title":"R.A.I.R.O.-Informatique Th\u00e9orique et Applications"},{"key":"25_CR6","volume-title":"volume 454 of Lecture Notes in Computer Science","author":"V. Diekert","year":"1990","unstructured":"V. Diekert. Combinatorics on Traces, volume 454 of Lecture Notes in Computer Science. Springer, Berlin-Heidelberg-New York, 1990."},{"key":"25_CR7","volume-title":"DAIMI Rep. PB 78","author":"A. Mazurkiewicz","year":"1977","unstructured":"A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977."},{"key":"25_CR8","series-title":"volume 255 of Lecture Notes in Computer Science","first-page":"279","volume-title":"Petri Nets, Applications and Relationship to other Models of Concurrency","author":"A. Mazurkiewicz","year":"1987","unstructured":"A. Mazurkiewicz. Trace theory. In W. Brauer et al., editors, Petri Nets, Applications and Relationship to other Models of Concurrency, volume 255 of Lecture Notes in Computer Science, pages 279\u2013324. Springer, Berlin-Heidelberg-New York, 1987."},{"key":"25_CR9","first-page":"346","volume-title":"STACS'88, volume 294 of Lecture Notes in Computer Science","author":"E. Ochmanski","year":"1988","unstructured":"E. Ochmanski. On morphisms onf trace monoids. In STACS'88, volume 294 of Lecture Notes in Computer Science, pages 346\u2013355. Springer, Berlin-Heidelberg-New York, 1988."},{"key":"25_CR10","first-page":"637","volume-title":"volume 372 of Lecture Notes in Computer Science","author":"D. Perrin","year":"1989","unstructured":"D. Perrin. Partial commutations. In Proceedings of the 16th International Colloquium on Automata, Languages and Programming (ICALP'89), Stresa (Italy) 1989, volume 372 of Lecture Notes in Computer Science, pages 637\u2013651. Springer, Berlin-Heidelberg-New York, 1989."},{"key":"25_CR11","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(92)90287-K","volume":"24","author":"N. Saheb","year":"1989","unstructured":"N. Saheb. Concurrency measure in commutation monoids. Discrete Applied Mathematics, 24:223\u2013236, 1989.","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1993"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57182-5_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:59:29Z","timestamp":1619571569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57182-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571827","9783540479277"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-57182-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}