{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T21:39:50Z","timestamp":1698269990704},"reference-count":24,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9177,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1988,6]]},"DOI":"10.1016\/s0747-7171(88)80034-8","type":"journal-article","created":{"date-parts":[[2008,5,29]],"date-time":"2008-05-29T10:22:56Z","timestamp":1212056576000},"page":"339-358","source":"Crossref","is-referenced-by-count":4,"title":["Pseudo-natural algorithms for finitely generated presentations of monoids and groups"],"prefix":"10.1016","volume":"5","author":[{"given":"Klaus","family":"Madlener","sequence":"first","affiliation":[]},{"given":"Friedrich","family":"Otto","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(88)80034-8_bib1","first-page":"695","article-title":"Zur algebraischen Charakteristik der durch kontext-freie Sprachen definierten Gruppen","volume":"11","author":"Anisimov","year":"1975","journal-title":"Elektron. Informationsverarbeitung und Kybernetik"},{"key":"10.1016\/S0747-7171(88)80034-8_bib2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF00263767","article-title":"Subrekursive Komplexit\u00e4t bei Gruppen; I, Gruppen mit vorgeschriebener Komplexit\u00e4t","volume":"9","author":"Avenhaus","year":"1977","journal-title":"Acta Informatica"},{"key":"10.1016\/S0747-7171(88)80034-8_bib3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02011863","article-title":"Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexit\u00e4t","volume":"19","author":"Avenhaus","year":"1978","journal-title":"Arch. math. Logik"},{"key":"10.1016\/S0747-7171(88)80034-8_bib4","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/BF00271645","article-title":"Finite complete rewriting systems and the complexity of the word problem","volume":"21","author":"Bauer","year":"1984","journal-title":"Acta Informatica"},{"key":"10.1016\/S0747-7171(88)80034-8_bib5_1","series-title":"Dissertation","article-title":"Ein Algorithmus zum Auffinden der Basiselemente des Restklassenrings nach einem nulldimensionalen Polynomideal","author":"Buchberger","year":"1970"},{"key":"10.1016\/S0747-7171(88)80034-8_bib5_2","first-page":"374","volume":"4","author":"Buchberger","year":"1965","journal-title":"Acta Informatica"},{"key":"10.1016\/S0747-7171(88)80034-8_bib6","first-page":"1","article-title":"Some classes of recursive functions","volume":"4","author":"Grzegorczyk","year":"1953","journal-title":"Rozprawy Math"},{"key":"10.1016\/S0747-7171(88)80034-8_bib7","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0020-0190(85)90018-3","article-title":"A note on a special one-rule semi-Thue system","volume":"21","author":"Jantzen","year":"1985","journal-title":"Inf. Proc. Letts"},{"key":"10.1016\/S0747-7171(88)80034-8_bib8","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0747-7171(88)80034-8_bib9","series-title":"Lab. Rep. No. 283","article-title":"On the uniform halting problem for term rewriting systems","author":"Huet","year":"1978"},{"key":"10.1016\/S0747-7171(88)80034-8_bib10","series-title":"Formal Language Theory Perspectives and Open Problems","article-title":"Equations and rewrite rules\u2014a survey","author":"Huet","year":"1980"},{"key":"10.1016\/S0747-7171(88)80034-8_bib11","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0304-3975(85)90023-4","article-title":"A finite Thue system with decidable word problem and without equivalent finite canonical system","volume":"35","author":"Kapur","year":"1985","journal-title":"Theor. Comp. Sci."},{"key":"10.1016\/S0747-7171(88)80034-8_bib12","series-title":"Computational Problems in Abstract Algebra","article-title":"Simple word problems in universal algebras","author":"Knuth","year":"1970"},{"key":"10.1016\/S0747-7171(88)80034-8_bib13","series-title":"Combinatorial Group Theory","author":"Lyndon","year":"1977"},{"key":"10.1016\/S0747-7171(88)80034-8_bib14","article-title":"Zur Komplexit\u00e4t des Konjugiertheitsproblems und verwandter algorithmischer Probleme in Gruppen","author":"Madlener","year":"1977","journal-title":"Habilitationsschrift, Kaiserslautern"},{"key":"10.1016\/S0747-7171(88)80034-8_bib15","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/S0747-7171(85)80022-5","article-title":"Pseudo-natural algorithms for the word problem for finitely presented monoids and groups","volume":"1","author":"Madiener","year":"1985","journal-title":"J. Symb. Comp."},{"key":"10.1016\/S0747-7171(88)80034-8_bib16","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01455888","article-title":"Das Identit\u00e4tsproblem f\u00fcr Gruppen mit einer definierenden Relation","volume":"106","author":"Magnus","year":"1932","journal-title":"Math. Annalen"},{"key":"10.1016\/S0747-7171(88)80034-8_bib17","series-title":"Combinatorial Group Theory","author":"Magnus","year":"1976"},{"key":"10.1016\/S0747-7171(88)80034-8_bib18","doi-asserted-by":"crossref","first-page":"223","DOI":"10.2307\/1968867","article-title":"On theories with a combinatorial definition of equivalence","volume":"43","author":"Newman","year":"1943","journal-title":"Ann. Math."},{"key":"10.1016\/S0747-7171(88)80034-8_bib19","series-title":"Seminaire Dubreil, 25\u00e8me Ann\u00e9e, 7-01-09, 1972-72","article-title":"Congruences parfaites et quasiparfaites","author":"Nivat","year":"1971"},{"key":"10.1016\/S0747-7171(88)80034-8_bib20","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0304-3975(83)90060-9","article-title":"Infinite regular Thue systems","volume":"25","author":"O\u2019Dunlaing","year":"1983","journal-title":"Theor. Comp. Sci."},{"key":"10.1016\/S0747-7171(88)80034-8_bib21","doi-asserted-by":"crossref","first-page":"1027","DOI":"10.2140\/pjm.1965.15.1027","article-title":"Classes of recursive functions based on Ackermann's function","volume":"15","author":"Ritchie","year":"1965","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0747-7171(88)80034-8_bib22","unstructured":"Squier, C. Word problems and a homological finiteness condition for monoids. Journal of Pure and Applied Algebra (in press)."},{"key":"10.1016\/S0747-7171(88)80034-8_bib23","series-title":"Report No. 91","article-title":"Teilklassen primitiv-rekursiver Wortfunktionen","author":"Weihrauch","year":"1974"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717188800348?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717188800348?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,28]],"date-time":"2018-12-28T07:24:40Z","timestamp":1545981880000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717188800348"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["S0747717188800348"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(88)80034-8","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1988,6]]}}}