{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:12Z","timestamp":1725663372125},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540172208"},{"type":"electronic","value":"9783540474210"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-17220-3_13","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T14:14:52Z","timestamp":1330179292000},"page":"145-155","source":"Crossref","is-referenced-by-count":0,"title":["Some results about confluence on a given congruence class"],"prefix":"10.1007","author":[{"given":"Friedrich","family":"Otto","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/BF00271645","volume":"21","author":"G. Bauer","year":"1984","unstructured":"G. Bauer, F. Otto; Finite complete rewriting systems and the complexity of the word problem; Acta Informatica 21 (1984), 521\u2013540.","journal-title":"Acta Informatica"},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0304-3975(76)90049-9","volume":"3","author":"C. Beeri","year":"1976","unstructured":"C. Beeri; An improvement on Valiant's decision procedure for equivalence of deterministic finite turn pushdown machines; Theoret. Comput. Sci. 3 (1976), 305\u2013320.","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/322290.322301","volume":"29","author":"R. V. Book","year":"1982","unstructured":"R.V. Book; Confluent and other types of Thue systems; Journal ACM 29 (1982), 171\u2013182.","journal-title":"Journal ACM"},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01744568","volume":"16","author":"R. V. Book","year":"1983","unstructured":"R.V. Book; A note on special Thue systems with a single defining relation; Math. Systems Theory 16 (1983), 57\u201360.","journal-title":"Math. Systems Theory"},{"key":"13_CR5","unstructured":"H. Buecken; Anwendung von Reduktionssystemen auf das Wortproblem in der Gruppentheorie; dissertation, Aachen, 1979."},{"key":"13_CR6","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1016\/0196-6774(85)90031-8","volume":"6","author":"B. Domanski","year":"1985","unstructured":"B. Domanski, M. Anshel; The complexity of Dehn's algorithm for word problems in groups; Journal Algorithms 6 (1985), 543\u2013549.","journal-title":"Journal Algorithms"},{"key":"13_CR7","series-title":"Lab. Rep.","volume-title":"On the uniform halting problem for term rewriting systems","author":"G. Huet","year":"1978","unstructured":"G. Huet, D.S. Lankford; On the uniform halting problem for term rewriting systems; Lab. Rep. No.283, INRIA, Le Chesnay, France, 1978."},{"key":"13_CR8","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 ACM 27 (1980), 797\u2013821.","journal-title":"Journal ACM"},{"key":"13_CR9","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0020-0190(85)90018-3","volume":"21","author":"M. Jantzen","year":"1985","unstructured":"M. Jantzen; A note on a special one-rule semi-Thue system; Inform. Proc. Letters 21 (1985), 135\u2013140.","journal-title":"Inform. Proc. Letters"},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0304-3975(85)90023-4","volume":"35","author":"D. Kapur","year":"1985","unstructured":"D. Kapur, P. Narendran; A finite Thue system with decidable word problem and without equivalent finite canonical system; Theoret. Comput. Sci. 35 (1985), 337\u2013344.","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"D. Knuth, P. Bendix; Simple word problems in universal algebras; in: J.Leech (ed.), Computational Problems in Abstract Algebra, Pergamon Press, 1970, 263\u2013297.","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"13_CR12","volume-title":"Canonical Forms in Finitely Presented Algebras","author":"P. LeChenadec","year":"1986","unstructured":"P. LeChenadec; Canonical Forms in Finitely Presented Algebras, Pitman Publ. Limited, John Wiley & Sons, New York, 1986."},{"key":"13_CR13","unstructured":"R.E. Lyndon, P.E. Schupp; Combinatorial Group Theory, Springer, 1977."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"P. Narendran, C. O'Dunlaing; Cancellativity in finitely presented semigroups; Journal Symbolic Computation, to appear.","DOI":"10.1016\/S0747-7171(89)80028-8"},{"key":"13_CR15","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0022-0000(85)90051-0","volume":"30","author":"P. Narendran","year":"1985","unstructured":"P. Narendran, C. O'Dunlaing, H. Rolletschek; Complexity of certain decision problems about congruential languages; Journal Comp. System Sciences, 30 (1985), 343\u2013358.","journal-title":"Journal Comp. System Sciences"},{"key":"13_CR16","unstructured":"C. O'Dunlaing; Finite and infinite regular Thue systems, PhD dissertation, Dept. of Math., University of California, Santa Barbara, 1981."},{"key":"13_CR17","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0304-3975(83)90060-9","volume":"25","author":"C. O'Dunlaing","year":"1983","unstructured":"C. O'Dunlaing; Infinite regular Thue systems; Theoret. Comput. Sci. 25 (1983), 171\u2013192.","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR18","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; Theoret. Comput. Sci. 33 (1984), 261\u2013278.","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR19","unstructured":"F. Otto; On deciding the confluence of a finite string-rewriting system on a given congruence class; Technical Report 159\/86, Fachbereich Informatik, Universitaet Kaiserslautern, 1986; also submitted for publication."},{"key":"13_CR20","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0019-9958(74)90839-0","volume":"25","author":"L. G. Valiant","year":"1974","unstructured":"L.G. Valiant; The equivalence problem for deterministic finite-turn pushdown automata; Inf. and Control 25 (1974), 123\u2013133.","journal-title":"Inf. and Control"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-17220-3_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:12:57Z","timestamp":1605625977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-17220-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540172208","9783540474210"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-17220-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}