{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T09:29:39Z","timestamp":1648805379513},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1992,12]]},"DOI":"10.1007\/bf01213858","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T15:25:59Z","timestamp":1109345159000},"page":"241-251","source":"Crossref","is-referenced-by-count":8,"title":["The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems"],"prefix":"10.1007","volume":"25","author":[{"given":"Friedrich","family":"Otto","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"Lecture Notes in Computer Science, Vol. 277","author":"B. Benninghofen","year":"1987","unstructured":"B. Benninghofen, S. Kemmerich, M. M. Richter,Systems of Reductions, Lecture Notes in Computer Science, Vol. 277, Springer-Verlag, Berlin, 1987."},{"key":"CR2","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 of the Association for Computing Machinery 29 (1982), 171?182.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0304-3975(83)90005-1","volume":"23","author":"R. V. Book","year":"1983","unstructured":"R. V. Book, Decidable sentences of Church-Rosser congruences,Theoretical Computer Science 23 (1983), 301?312.","journal-title":"Theoretical Computer Science"},{"key":"CR4","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,Journal of Symbolic Computation 3 (1987), 39?68.","journal-title":"Journal of Symbolic Computation"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(81)90078-5","volume":"16","author":"R. V. Book","year":"1981","unstructured":"R. V. Book, C. O'Dunlaing, Testing for the Church-Rosser property,Theoretical Computer Science 16 (1981), 223?229.","journal-title":"Theoretical Computer Science"},{"key":"CR6","unstructured":"H. B\u00fccken, Reduction systems and small cancellation theory,Proceedings of the 4th Workshop on Automated Deduction (1979), pp. 53?59."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1016\/0021-8693(79)90238-2","volume":"57","author":"R. H. Gilman","year":"1979","unstructured":"R. H. Gilman, Presentations of groups and monoids,Journal of Algebra 57 (1979), 544?554.","journal-title":"Journal of Algebra"},{"key":"CR8","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J. E. Hopcroft","year":"1979","unstructured":"J. E. Hopcroft, J. D. Ullman,Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979."},{"key":"CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61549-8","volume-title":"Confluent String Rewriting","author":"M. Jantzen","year":"1988","unstructured":"M. Jantzen,Confluent String Rewriting, Springer-Verlag, Berlin, 1988."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(85)90008-8","volume":"35","author":"D. Kapur","year":"1985","unstructured":"D. Kapur, M. S. Krishnamoorthy, R. F. McNaughton, P. Narendran, AnO(\u00a6T\u00a63) algorithm for testing the Church-Rosser property of Thue systems,Theoretical Computer Science 35 (1985), 109?114.","journal-title":"Theoretical Computer Science"},{"key":"CR11","volume-title":"Canonical Forms in Finitely Presented Algebras","author":"Ph. LeChenadec","year":"1986","unstructured":"Ph. LeChenadec,Canonical Forms in Finitely Presented Algebras, Pitman, London, Wiley, New York, 1986."},{"key":"CR12","volume-title":"Combinatorial Group Theory","author":"R. C. Lyndon","year":"1977","unstructured":"R. C. Lyndon, P. E. Schupp,Combinatorial Group Theory, Springer-Verlag, Berlin, 1977."},{"key":"CR13","first-page":"279","volume-title":"Lecture Notes in Computer Science, Vol. 510","author":"K. Madiener","year":"1991","unstructured":"K. Madiener, P. Narendran, F. Otto, A specialized completion procedure for monadic string-rewriting systems presenting groups, in: J. Leach Albert, B. Monien, M. Rodriguez Artalejo (eds.),Automata, Languages, and Programming, Proceedings of the 18th International Colloquium, Lecture Notes in Computer Science, Vol. 510, Springer-Verlag, Berlin, 1991, pp. 279?290."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0020-0190(87)90149-9","volume":"24","author":"K. Madiener","year":"1987","unstructured":"K. Madiener, F. Otto, Using string-rewriting for solving the word problem for finitely presented groups,Information Processing Letters 24 (1987), 281?284.","journal-title":"Information Processing Letters"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/0021-8693(87)90136-0","volume":"108","author":"R. F. McNaughton","year":"1987","unstructured":"R. F. McNaughton, P. Narendran, Special monoids and special Thue systems,Journal of Algebra 108 (1987), 248?255.","journal-title":"Journal of Algebra"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0022-0000(87)90017-1","volume":"35","author":"F. Otto","year":"1987","unstructured":"F. Otto, On deciding the confluence of a finite string-rewriting system on a given congruence class,Journal of Computer and System Sciences 35 (1987), 285?310.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"F. Otto, Completing a finite special string-rewriting system on the congruence class of the empty word,Applicable Algebra in Engineering, Communication and Computing, to appear.","DOI":"10.1007\/BF01614148"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/BF01178585","volume":"28","author":"F. Otto","year":"1991","unstructured":"F. Otto, L. Zhang, Decision problems for finite special string-rewriting systems that are confluent on some congruence class,Acta Informatica 28 (1991), 477?510.","journal-title":"Acta Informatica"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01213858.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01213858\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01213858","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T09:51:09Z","timestamp":1556790669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01213858"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["BF01213858"],"URL":"https:\/\/doi.org\/10.1007\/bf01213858","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}