{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:52Z","timestamp":1725663712389},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540552109"},{"type":"electronic","value":"9783540467755"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55210-3_212","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:55:07Z","timestamp":1330250107000},"page":"557-565","source":"Crossref","is-referenced-by-count":3,"title":["Conditional semi-Thue systems for presenting monoids"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Dei\u00df","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"44_CR1","volume-title":"PhD thesis","author":"G. Bauer","year":"1981","unstructured":"G\u00fcnther Bauer. Zur Darstellung von Monoiden durch konfluente Regelsysteme. PhD thesis, Fachbereich Informatik, Universit\u00e4t Kaiserslautern, 1981. in German."},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Ronald V. Book. Thue systems as rewriting systems. In Proc. of 1st Rewriting Techniques and Applications, pages 63\u201394. Springer, 1985. LNCS 202.","DOI":"10.1007\/3-540-15976-2_3"},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"Martin D. Davis. A note on universal turing machines. In C. E. Shannon and J. McCarthy, editors, Automata Studies, pages 167\u2013175. Princeton Press, 1956.","DOI":"10.1515\/9781400882618-008"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"Martin D. Davis and Elaine J. Weyuker. Computability, Complexity, and Languages. Academic Press, 1983.","DOI":"10.1016\/B978-0-12-206380-0.50020-1"},{"key":"44_CR5","unstructured":"Harald Ganzinger. A completion procedure for conditional equations. Technical Report 234, Fachbereich Informatik, Universit\u00e4t Dortmund, 1987."},{"issue":"4","key":"44_CR6","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"G\u00e9rard Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the ACM, 27(4):797\u2013821, oct 1980.","journal-title":"Journal of the ACM"},{"key":"44_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61549-8","volume-title":"Confluent String Rewriting","author":"M. Jantzen","year":"1988","unstructured":"Matthias Jantzen. Confluent String Rewriting. Springer, Berlin, Heidelberg, New York, 1988."},{"key":"44_CR8","unstructured":"Jean Pierre Jouannaud and Bernard Waldmann. Reductive conditional term rewriting systems. In Proceedings of the 3rd IFIP Working Conference on Formal Description of Programming Concepts. North-Holland, 1986."},{"key":"44_CR9","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(84)90087-2","volume":"33","author":"S. Kaplan","year":"1984","unstructured":"Stephane Kaplan. Conditional rewrite rules. Theoretical Computer Science, 33:175\u2013193, 1984.","journal-title":"Theoretical Computer Science"},{"key":"44_CR10","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0747-7171(87)80010-X","volume":"4","author":"S. Kaplan","year":"1987","unstructured":"Stephane Kaplan. Simplifying conditional term rewriting systems: Unification, termination and confluence. Journal of Symbolic Computation, 4:295\u2013334, 1987.","journal-title":"Journal of Symbolic Computation"},{"key":"44_CR11","volume-title":"Technical report","author":"H. Kirchner","year":"1989","unstructured":"Helene Kirchner and Miki Hermann. Computing meta-rules from crossed rewrite systems. Technical report, CRIN, Nancy, 1989."},{"key":"44_CR12","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0304-3975(85)90023-4","volume":"35","author":"D. Kapur","year":"1985","unstructured":"Deepak Kapur and Paliath Narendran. A finite Thue system with decidable word problem and without equivalent finite canonical system. Theoretical Computer Science, 35:337\u2013344, 1985.","journal-title":"Theoretical Computer Science"},{"key":"44_CR13","unstructured":"Zohar Manna. Mathematical Theory of Computation. Computer Science Series. McGraw-Hill, 1974."},{"key":"44_CR14","doi-asserted-by":"crossref","unstructured":"Andrea Sattler-Klein. Divergence phenomena during completion. In Ronald V. Book, editor, Proc. of 4th Rewriting Techniques and Applications, pages 374\u2013385. Springer, 1991. LNCS 488.","DOI":"10.1007\/3-540-53904-2_111"},{"key":"44_CR15","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0747-7171(87)80002-0","volume":"3","author":"C. C. Sims","year":"1987","unstructured":"C. C. Sims. Verifying nilpotence. Journal of Symbolic Computation, 3:231\u2013247, 1987.","journal-title":"Journal of Symbolic Computation"},{"key":"44_CR16","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0022-4049(87)90129-0","volume":"49","author":"C. Squier","year":"1987","unstructured":"Craig Squier. Word problems and a homological finiteness condition for monoids. Journal of pure and applied algebra, 49:201\u2013217, 1987.","journal-title":"Journal of pure and applied algebra"},{"key":"44_CR17","volume-title":"A finiteness condition for rewriting systems","author":"C. Squier","year":"1988","unstructured":"Craig Squier. A finiteness condition for rewriting systems. Department of Mathematical Sciences, SUNY-Binghamton, Binghamton, NY 13901, 1988."},{"key":"44_CR18","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1145\/321160.321170","volume":"10","author":"J. C. Shepherdson","year":"1963","unstructured":"J. C. Shepherdson and H. E. Sturgis. Computability of recursive functions. Journal of the ACM, 10:217\u2013255, 1963.","journal-title":"Journal of the ACM"},{"key":"44_CR19","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02573590","volume":"25","author":"J. Siekmann","year":"1982","unstructured":"J\u00f6rg Siekmann and P. Szabo. A noetherian and confluent rewrite system for idempotent semigroups, semigroup forum, 25:83\u2013110, 1982.","journal-title":"semigroup forum"}],"container-title":["Lecture Notes in Computer Science","STACS 92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55210-3_212.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:58:14Z","timestamp":1605646694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55210-3_212"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540552109","9783540467755"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-55210-3_212","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}