{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:33:55Z","timestamp":1725456835899},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633860"},{"type":"electronic","value":"9783540695295"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0036200","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T07:47:22Z","timestamp":1134287242000},"page":"388-399","source":"Crossref","is-referenced-by-count":2,"title":["FDT is undecidable for finitely presented monoids with solvable word problems"],"prefix":"10.1007","author":[{"given":"Friedrich","family":"Otto","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Sattler-Klein","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,21]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-9771-7","volume-title":"String-Rewriting Systems","author":"R.V. Book","year":"1993","unstructured":"R.V. Book and F. Otto. String-Rewriting Systems. Springer-Verlag, New York, 1993."},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/jsco.1994.1039","volume":"18","author":"R. Cremanns","year":"1994","unstructured":"R. Cremanns and F. Otto. Finite derivation type implies the homological finiteness condition FP 3. J. Symbolic Computation, 18:91\u2013112, 1994.","journal-title":"J. Symbolic Computation"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1006\/jsco.1996.0046","volume":"22","author":"R. Cremanns","year":"1996","unstructured":"R. Cremanns and F. Otto. For groups the property of having finite derivation type is equivalent to the homological finiteness condition FP 3. J. Symbolic Computation, 22:155\u2013177, 1996.","journal-title":"J. Symbolic Computation"},{"key":"33_CR4","unstructured":"V. Diekert. Private communication. March 1997."},{"key":"33_CR5","first-page":"263","volume-title":"Computational Problems in Abstract Algebra","author":"D. Knuth","year":"1970","unstructured":"D. Knuth and P. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263\u2013297. Pergamon Press, New York, 1970."},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0022-4049(90)90106-R","volume":"65","author":"Y. Kobayashi","year":"1990","unstructured":"Y. Kobayashi. Complete rewriting systems and homology of monoid algebras. J. Pure Applied Algebra, 65:263\u2013275, 1990.","journal-title":"J. Pure Applied Algebra"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0022-4049(94)00043-I","volume":"98","author":"Y. Lafont","year":"1995","unstructured":"Y. Lafont. A finiteness condition for monoids presented by complete rewriting systems (after C. C. Squier). J. Pure Applied Algebra, 98:229\u2013244, 1995.","journal-title":"J. Pure Applied Algebra"},{"key":"33_CR8","first-page":"226","volume-title":"Advances in Algorithms, Languages, and Complexity","author":"F. Otto","year":"1997","unstructured":"F. Otto and Y. Kobayashi. Properties of monoids that are presented by finite convergent string-rewriting systems-a survey. In D.Z. Du and K. Ko, editors, Advances in Algorithms, Languages, and Complexity. Kluwer Academic Publ., Dordrecht, 1997, pp. 226\u2013266."},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"F. Otto and A. Sattler-Klein.FDT is undecidable for finitely presented monoids with solvable word problems. Preprint No. 3\/97, Universit\u00e4t Kassel, Fachbereich Mathematik\/Informatik, March 1997.","DOI":"10.1007\/BFb0036200"},{"key":"33_CR10","unstructured":"F. Otto and A. Sattler-Klein. Some remarks on finitely presented monoids with automatic structure. In preparation."},{"key":"33_CR11","unstructured":"F. Otto. Modular properties of monoids and string-rewriting systems. In preparation."},{"key":"33_CR12","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1142\/S0218196795000252","volume":"5","author":"S.J. Pride","year":"1995","unstructured":"S.J. Pride. Low-dimensional homotopy theory for monoids. International Journal of Algebra and Computation, 5:631\u2013649, 1995.","journal-title":"International Journal of Algebra and Computation"},{"key":"33_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/3-540-53904-2_111","volume-title":"Rewriting Techniques and Applications","author":"A. Sattler-Klein","year":"1991","unstructured":"A. Sattler-Klein. Divergence phenomena during completion. In R.V. Book, editor, Rewriting Techniques and Applications, pages 374\u2013385. Springer-Verlag, Berlin, 1991. Lecture Notes in Computer Science 488."},{"key":"33_CR14","unstructured":"A. Sattler-Klein. A systematic study of infinite canonical systems generated by Knuth-Bendix completion and related problems. Doctoral Dissertation, Fachbereich Informatik, Universit\u00e4t Kaiserslautern, February 1996."},{"key":"33_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Rewriting Techniques and Applications","author":"A. Sattler-Klein","year":"1997","unstructured":"A. Sattler-Klein. New undecidability results for finitely presented monoids. In H. Comon, editor, Rewriting Techniques and Applications. Springer-Verlag, Berlin, 1997. Lecture Notes in Computer Science 1232, to appear."},{"key":"33_CR16","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0304-3975(94)90175-9","volume":"131","author":"C.C. Squier","year":"1994","unstructured":"C.C. Squier, F. Otto, and Y. Kobayashi. A finiteness condition for rewriting systems. Theoretical Computer Science, 131:271\u2013294, 1994.","journal-title":"Theoretical Computer Science"},{"key":"33_CR17","doi-asserted-by":"publisher","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 Applied Algebra, 49:201\u2013217, 1987.","journal-title":"J. Pure Applied Algebra"},{"key":"33_CR18","doi-asserted-by":"crossref","first-page":"1275","DOI":"10.1145\/227683.227689","volume":"42","author":"Y. Toyama","year":"1995","unstructured":"Y. Toyama, J.W. Klop, and H.P. Barendregt. Termination for direct sums of left-linear complete term rewriting systems. J. Assoc. for Comput. Machinery, 42:1275\u20131304, 1995.","journal-title":"J. Assoc. for Comput. Machinery"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0036200","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:53:56Z","timestamp":1586613236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0036200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633860","9783540695295"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0036200","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}