{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:27Z","timestamp":1725664527417},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540593409"},{"type":"electronic","value":"9783540492375"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59340-3_9","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:14:34Z","timestamp":1330276474000},"page":"114-126","source":"Crossref","is-referenced-by-count":1,"title":["On efficient reduction algorithms for some trace rewriting systems"],"prefix":"10.1007","author":[{"given":"Michael","family":"Bertol","sequence":"first","affiliation":[]},{"given":"Volker","family":"Diekert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"9_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. Theoret. Comput. Sci., 60:1\u201382, 1988.","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR2","volume-title":"Texts and Monographs in Computer Science","author":"R.V. Book","year":"1993","unstructured":"R.V. Book and F. Otto. String Rewriting Systems. Texts and Monographs in Computer Science. Springer Verlag, New York, 1993."},{"key":"9_CR3","volume-title":"Number 85 in Lecture Notes in Mathematics","author":"P. Cartier","year":"1969","unstructured":"P. Cartier and D. Foata. Probl\u00e8mes combinatoires de commutation et r\u00e9arrangements. Number 85 in Lecture Notes in Mathematics. Springer, Berlin-Heidelberg-New York, 1969."},{"key":"9_CR4","volume-title":"Th\u00e9se","author":"M. Clerbout","year":"1984","unstructured":"M. Clerbout. Commutations partielles et familles de langages. Th\u00e9se, Universit\u00e9 de Lille (France), 1984."},{"key":"9_CR5","first-page":"241","volume":"35","author":"M. Clerbout","year":"1985","unstructured":"M. Clerbout and M. Latteux. Partial commutations and faithful rational transductions. Theoretical Computer Science, 35:241\u2013254, 1985.","journal-title":"Theoretical Computer Science"},{"key":"9_CR6","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. \u2014 Informatique Th\u00e9orique et Applications, 19:21\u201332, 1985.","journal-title":"R.A.I.R.O. \u2014 Informatique Th\u00e9orique et Applications"},{"key":"9_CR7","first-page":"262","volume-title":"number 324 in Lecture Notes in Computer Science","author":"M. Dauchet","year":"1988","unstructured":"Max Dauchet. Termination of rewriting is undecidable in the one-rule case. In M. Chytil et al., editors, Proceedings of the 13th Symposium on Mathematical Foundations of Computer Science (MFCS'88), Carlsbad (CSSR) 1988, number 324 in Lecture Notes in Computer Science, pages 262\u2013288, Berlin-Heidelberg-New York, 1988. Springer."},{"key":"9_CR8","first-page":"138","volume-title":"number 415 in Lecture Notes in Computer Science","author":"V. Diekert","year":"1990","unstructured":"V. Diekert. Combinatorial rewriting on traces. In C. Choffrut et al., editors, Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science (STACS'90), Rouen (France) 1990, number 415 in Lecture Notes in Computer Science, pages 138\u2013151, Berlin-Heidelberg-New York, 1990. Springer."},{"key":"9_CR9","volume-title":"Number 454 in Lecture Notes in Computer Science","author":"V. Diekert","year":"1990","unstructured":"V. Diekert. Combinatorics on Traces. Number 454 in Lecture Notes in Computer Science. Springer, Berlin-Heidelberg-New York, 1990."},{"key":"9_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(90)90003-Z","volume":"74","author":"V. Diekert","year":"1990","unstructured":"V. Diekert. Word problems over traces which are solvable in linear time. Theoret. Comput. Sci., 74:3\u201318, 1990.","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR11","first-page":"1","volume-title":"number 710 in Lecture Notes in Computer Science","author":"V. Diekert","year":"1993","unstructured":"V. Diekert. Rewriting, semi-commutations, and M\u00f6bius functions. In Z. \u00c9sik, editor, Proc. of the 9th Fundamentals of Computation Theory (FCT 93), Szeged (Hungary) 1993, number 710 in Lecture Notes in Computer Science, pages 1\u201315, Berlin-Heidelberg-New York, 1993. Springer. Invited Lecture."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"V. Diekert and G. Rozenberg, editors. Book of Traces. World Scientific, Singapore, to appear.","DOI":"10.1142\/2563"},{"key":"9_CR13","volume-title":"Report FBI-HH-B-121\/86","author":"W. Fischer","year":"1986","unstructured":"W. Fischer. \u00dcber erkennbare und rationale Mengen in freien partiell kommutativen Monoiden. Report FBI-HH-B-121\/86, Fachbereich Informatik der Universit\u00e4t Hamburg, Hamburg, 1986. (Diplomarbeit 1985)."},{"key":"9_CR14","volume-title":"EATCS Monographs on Theoretical Computer Science 14","author":"M. Jantzen","year":"1988","unstructured":"M. Jantzen. Confluent String Rewriting. EATCS Monographs on Theoretical Computer Science 14. Springer, Berlin-Heidelberg-New York, 1988."},{"key":"9_CR15","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/321765.321782","volume":"20","author":"R. Keller","year":"1973","unstructured":"R. Keller. Parallel program schemata and maximal parallelism I. Fundamental results. Journal of the Association of Computing Machinery, 20:514\u2013537, 1973.","journal-title":"Journal of the Association of Computing Machinery"},{"key":"9_CR16","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":"9_CR17","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":"9_CR18","series-title":"Lecture Notes in Computer Science 255","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, W. Reisig, and G. Rozenberg, editors, Petri Nets, Applications and Relationship to other Models of Concurrency, Lecture Notes in Computer Science 255, pages 279\u2013324. Springer, Berlin-Heidelberg-New York, 1987."},{"key":"9_CR19","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(88)90049-X","volume":"29","author":"P. Narendran","year":"1988","unstructured":"P. Narendran and F. Otto. Preperfectness is undecidable for Thue systems containing only length-reducing rules and a single commutation rule. Information Processing Letters, 29:125\u2013130, 1988.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59340-3_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:27:14Z","timestamp":1619573234000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59340-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540593409","9783540492375"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-59340-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}