{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:46Z","timestamp":1725663766419},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540545224"},{"type":"electronic","value":"9783540384366"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54522-0_118","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:58:47Z","timestamp":1330210727000},"page":"292-303","source":"Crossref","is-referenced-by-count":0,"title":["Some undecidability results for weakly confluent monadic string-rewriting systems"],"prefix":"10.1007","author":[{"given":"Friedrich","family":"Otto","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0022-0000(87)90015-8","volume":"35","author":"J. Autebert","year":"1987","unstructured":"J. Autebert, L. Boasson, G. Senizergues; Groups and NTS languages; J. Comput. System Sciences 35 (1987) 243\u2013267.","journal-title":"J. Comput. System Sciences"},{"key":"28_CR2","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0304-3975(83)90005-1","volume":"24","author":"R.V. Book","year":"1983","unstructured":"R.V. Book; Decidable sentences of Church-Rosser congruences; Theoretical Computer Science 24 (1983) 301\u2013312.","journal-title":"Theoretical Computer Science"},{"key":"28_CR3","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0747-7171(87)80021-4","volume":"3","author":"R.V. Book","year":"1987","unstructured":"R.V. Book; Thue systems as rewriting systems; J. Symbolic Computation 3 (1987) 39\u201368.","journal-title":"J. Symbolic Computation"},{"key":"28_CR4","volume-title":"Computability and Unsolvability","author":"M. Davis","year":"1958","unstructured":"M. Davis; Computability and Unsolvability; McGraw-Hill: New York, 1958."},{"key":"28_CR5","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; J. Assoc. Comput. Mach. 27 (1980) 797\u2013821.","journal-title":"J. Assoc. Comput. Mach."},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"K. Madlener, P. Narendran, F. Otto; A specialized completion procedure for monadic string-rewriting systems presenting groups; in: Proceedings of ICALP 91, Lect. Notes Comp. Sci., to appear.","DOI":"10.1007\/3-540-54233-7_141"},{"key":"28_CR7","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1007\/BFb0020796","volume":"480","author":"K. Madlener","year":"1991","unstructured":"K. Madlener, F. Otto; Decidable sentences for context-free groups; in: C.Choffrut, M. Jantzen (eds.), Proceedings of STACS'91, Lect.Notes Comp.Sci. 480 (1991) 160\u2013171.","journal-title":"Lect.Notes Comp.Sci."},{"key":"28_CR8","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/BF00279954","volume":"25","author":"P. Narendran","year":"1988","unstructured":"P. Narendran, F. Otto; Elements of finite order for finite weight-reducing and confluent Thue systems; Acta Informatica 25 (1988) 573\u2013591.","journal-title":"Acta Informatica"},{"key":"28_CR9","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0304-3975(84)90090-2","volume":"33","author":"F. Otto","year":"1984","unstructured":"F. Otto; Some undecidability results for non-monadic Church-Rosser Thue systems; Theoretical Computer Science 33 (1984) 261\u2013278.","journal-title":"Theoretical Computer Science"},{"key":"28_CR10","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF00268077","volume":"23","author":"F. Otto","year":"1986","unstructured":"F. Otto; On deciding whether a monoid is a free monoid or is a group; Acta Informatica 23 (1986) 99\u2013110.","journal-title":"Acta Informatica"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"F. Otto; When is an extension of a specification consistent? Decidable and undecidable cases; J. Symbolic Computation, to appear.","DOI":"10.1016\/S0747-7171(08)80150-2"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"F. Otto, L. Zhang; Decision problems for finite special string-rewriting systems that are confluent on some congruence class; Acta Informatica, to appear.","DOI":"10.1007\/BF01178585"},{"key":"28_CR13","unstructured":"L. Zhang; Weak confluence is tractable for finite monadic string-rewriting systems; manuscript, 1990."}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54522-0_118.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T14:08:44Z","timestamp":1713622124000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54522-0_118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540545224","9783540384366"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-54522-0_118","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}