{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:04Z","timestamp":1725663364079},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540542339"},{"type":"electronic","value":"9783540475163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54233-7_141","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:37:29Z","timestamp":1330209449000},"page":"279-290","source":"Crossref","is-referenced-by-count":7,"title":["A specialized completion procedure for monadic string-rewriting systems presenting groups"],"prefix":"10.1007","author":[{"given":"K.","family":"Madlener","sequence":"first","affiliation":[]},{"given":"P.","family":"Narendran","sequence":"additional","affiliation":[]},{"given":"F.","family":"Otto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0022-0000(87)90015-8","volume":"35","author":"J.M. Autebert","year":"1987","unstructured":"J.M. Autebert, L. Boasson, G. Senizergues; Groups and NTS languages; J. Comput. System Sci. 35 (1987), 243\u2013267.","journal-title":"J. Comput. System Sci."},{"key":"21_CR2","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\u2013312.","journal-title":"Theoretical Computer Science"},{"key":"21_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":"21_CR4","unstructured":"H. B\u00fccken; Reduction systems and small cancellation theory; in: Proceedings 4th Workshop on Automated Deduction (1979), 53\u201359."},{"key":"21_CR5","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; J. of Algebra 57 (1979), 544\u2013554.","journal-title":"J. of Algebra"},{"key":"21_CR6","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":"21_CR7","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, Berlin, 1988)."},{"key":"21_CR8","doi-asserted-by":"crossref","first-page":"1052","DOI":"10.1137\/0214073","volume":"14","author":"D. Kapur","year":"1985","unstructured":"D. Kapur, P. Narendran; The Knuth-Bendix completion procedure and Thue systems; SIAM J. on Computing 14 (1985), 1052\u20131072.","journal-title":"SIAM J. on Computing"},{"key":"21_CR9","first-page":"263","volume-title":"Computational Problems in Abstract Algebra","author":"D. Knuth","year":"1970","unstructured":"D. Knuth, P. Bendix; Simple word problems in universal algebras; in: J. Leech (ed.), Computational Problems in Abstract Algebra (Pergamon, New York, 1970), 263\u2013297."},{"key":"21_CR10","volume-title":"Canonical Forms in Finitely Presented Algebras","author":"P. LeChenadec","year":"1986","unstructured":"Ph. LeChenadec; Canonical Forms in Finitely Presented Algebras (Pitman: London, Wiley: New York, Toronto, 1986)."},{"key":"21_CR11","volume-title":"Combinatorial Group Theory","author":"R.C. Lyndon","year":"1977","unstructured":"R.C. Lyndon, P.E. Schupp; Combinatorial Group Theory (Springer, Berlin, 1977)."},{"key":"21_CR12","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0020-0190(87)90149-9","volume":"24","author":"K. Madlener","year":"1987","unstructured":"K. Madlener, F. Otto; Using string-rewriting for solving the word problem for finitely presented groups; Information Processing Letters 24 (1987), 281\u2013284.","journal-title":"Information Processing Letters"},{"key":"21_CR13","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0304-3975(89)90002-9","volume":"67","author":"K. Madlener","year":"1989","unstructured":"K. Madlener, F. Otto; About the descriptive power of certain classes of finite string-rewriting systems; Theoretical Computer Science 67 (1989), 143\u2013172.","journal-title":"Theoretical Computer Science"},{"key":"21_CR14","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, Lecture Notes in Computer Science 480 (1991), 160\u2013171.","journal-title":"Lecture Notes in Computer Science"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"K. Madlener, P. Narendran, F. Otto: A specialized completion procedure for monadic string-rewriting systems presenting groups, SEKI-Report SR-90-24. University of Kaiserslautern (1990).","DOI":"10.1007\/3-540-54233-7_141"},{"key":"21_CR16","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0022-0000(83)90003-X","volume":"26","author":"D.E. Muller","year":"1983","unstructured":"D.E. Muller, P.E. Schupp; Groups the theory of ends, and context-free languages; J. Comput. Systems Ci. 26 (1983), 295\u2013310.","journal-title":"J. Comput. Systems Ci."},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"P. Narendran, C. O'Dunlaing, F. Otto; It is undecidable whether a finite special string-rewriting system presents a group: Discrete Math., to appear.","DOI":"10.1016\/0012-365X(91)90040-9"},{"key":"21_CR18","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":"21_CR19","first-page":"285","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; J. Comp. Sci. Sciences 35 (1987), 285\u2013310.","journal-title":"J. Comp. Sci. Sciences"},{"key":"21_CR20","volume-title":"The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems","author":"F. Otto","year":"1990","unstructured":"F. Otto; The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems; Preprint No. 4\/90, FB Math., GhK, Kassel, West Germany, 1990."},{"key":"21_CR21","volume-title":"Completing a finite special string-rewriting system presenting a group on the congruence class of the empty word","author":"F. Otto","year":"1990","unstructured":"F. Otto; Completing a finite special string-rewriting system presenting a group on the congruence class of the empty word; Preprint No. 8\/90, FB Math., GhK, Kassel, West Germany, 1990."},{"key":"21_CR22","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0022-4049(87)90129-0","volume":"49","author":"C.C. Squier","year":"1987","unstructured":"C.C. Squier; Word problems and a homological finiteness condition for monoids, J. Pure Appl. Algebra 49 (1987), 201\u2013217.","journal-title":"J. Pure Appl. Algebra"},{"key":"21_CR23","unstructured":"L. Zhang; The word problem and undecidability results for finitely presented special monoids; submitted for publication."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54233-7_141.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:53:12Z","timestamp":1605646392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54233-7_141"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540542339","9783540475163"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-54233-7_141","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}