{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:49Z","timestamp":1725663589883},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540558088"},{"type":"electronic","value":"9783540472919"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55808-x_50","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:46:53Z","timestamp":1330249613000},"page":"511-521","source":"Crossref","is-referenced-by-count":1,"title":["One-rule trace-rewriting systems and confluence"],"prefix":"10.1007","author":[{"given":"C.","family":"Wrathall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Diekert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Otto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,30]]},"reference":[{"key":"50_CR1","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. Appl. 19, 21\u201332 (1985)","journal-title":"RAIRO Inform. Theor. Appl."},{"key":"50_CR2","series-title":"Lecture Notes in Computer Science 324","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/BFb0017149","volume-title":"Mathematical Foundations of Computer Science 1988. Proceedings","author":"M. Dauchet","year":"1988","unstructured":"M. Dauchet: Termination of rewriting is undecidable in the one-rule case. In: M.P. Chytil, L. Janiga, V. Koubek (eds.): Mathematical Foundations of Computer Science 1988. Proceedings. Lecture Notes in Computer Science 324, pp. 262\u2013268. Berlin: Springer 1988"},{"key":"50_CR3","first-page":"243","volume-title":"Handbook of Theoretical Computer Science, Vol. B","author":"N. Dershowitz","year":"1990","unstructured":"N. Dershowitz, J.P. Jouannaud: Rewrite systems. In: Handbook of Theoretical Computer Science, Vol. B, pp. 243\u2013320. Amsterdam: Elsevier 1990"},{"key":"50_CR4","series-title":"Lecture Notes in Computer Science 267","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/3-540-18088-5_5","volume-title":"Automata, Languages and Programming. Proceedings","author":"V. Diekert","year":"1987","unstructured":"V. Diekert: On the Knuth-Bendix completion for concurrent processes. In: Th. Ottmann (ed.): Automata, Languages and Programming. Proceedings. Lecture Notes in Computer Science 267, pp. 42\u201353. Berlin: Springer 1987. Also in Theor. Compt. Science 66, 117\u2013136 (1989)"},{"key":"50_CR5","volume-title":"Lecture Notes in Computer Science 454","author":"V. Diekert","year":"1990","unstructured":"V. Diekert: Combinatorics on Traces. Lecture Notes in Computer Science 454. Berlin: Springer 1990"},{"key":"50_CR6","doi-asserted-by":"publisher","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. Theor. Comput. Science 46, 159\u2013174 (1986)","journal-title":"Theor. Comput. Science"},{"key":"50_CR7","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"G. Huet: Confluent reductions: abstract properties and applications to term rewriting systems. Journal Assoc. Comput. Mach. 27, 797\u2013821 (1980)","journal-title":"Journal Assoc. Comput. Mach."},{"key":"50_CR8","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/0215084","volume":"15","author":"J.P. Jouannaud","year":"1986","unstructured":"J.P. Jouannaud, H. Kirchner: Completion of a set of rules modulo a set of equations. SIAM Journal on Computing 15, 1155\u20131194 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"50_CR9","unstructured":"W. Kurth: Termination und Konfluenz von Semi-Thue Systemen mit nur einer Regel. Dissertation. Clausthal: Math.-Naturwissenschaftl. Fakult\u00e4t, Technische Universit\u00e4t 1990"},{"key":"50_CR10","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1983","unstructured":"M. Lothaire: Combinatorics on Words. Reading, M.A.: Addison-Wesley 1983"},{"key":"50_CR11","series-title":"Lecture Notes in Computer Science 176","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BFb0030293","volume-title":"Mathematical Foundations of Computer Science 1984. Proceedings","author":"A. Mazurkiewicz","year":"1984","unstructured":"A. Mazurkiewicz: Traces, histories and graphs: Instances of a process monoid. In: M. Chytil, V. Koubek (eds.): Mathematical Foundations of Computer Science 1984. Proceedings. Lecture Notes in Computer Science 176, pp. 115\u2013133. Berlin: Springer 1984"},{"key":"50_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0020-0190(88)90049-X","volume":"29","author":"P. Narendran","year":"1988","unstructured":"P. Narendran, 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"},{"key":"50_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0304-3975(89)90019-4","volume":"67","author":"F. Otto","year":"1989","unstructured":"F. Otto: On deciding confluence of finite string-rewriting systems modulo partial commutativity. Theoretical Computer Science 67, 19\u201335 (1989)","journal-title":"Theoretical Computer Science"},{"key":"50_CR14","volume-title":"Interner Bericht No. 184\/88","author":"F. Otto","year":"1988","unstructured":"F. Otto, C. Wralhall: Characterizations of overlaps in free partially commutative monoids. Interner Bericht No. 184\/88. Kaiserslautern: Fachbereich Informatik, Universit\u00e4t 1988"},{"key":"50_CR15","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/0022-0000(91)90010-3","volume":"42","author":"F. Otto","year":"1991","unstructured":"F. Otto, C. Wrathall: Overlaps in free partially commutative monoids. Journal Computer System Sciences 42, 186\u2013198 (1991)","journal-title":"Journal Computer System Sciences"},{"key":"50_CR16","series-title":"Lecture Notes in Computer Science 572","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/3-540-55124-7_11","volume-title":"Word Equations and Related Topics","author":"C. Wrathall","year":"1992","unstructured":"C. Wrathall: Confluence of one-rule Thue systems. In: K.U. Schulz (ed.): Word Equations and Related Topics. Lecture Notes in Computer Science 572, pp. 237\u2013246. Berlin: Springer 1992."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1992"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55808-X_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:36:08Z","timestamp":1619573768000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55808-X_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540558088","9783540472919"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-55808-x_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}