{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T07:56:17Z","timestamp":1772438177583,"version":"3.50.1"},"reference-count":35,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1985,12,1]],"date-time":"1985-12-01T00:00:00Z","timestamp":502243200000},"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":10090,"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":[[1985,12]]},"DOI":"10.1016\/s0747-7171(85)80022-5","type":"journal-article","created":{"date-parts":[[2008,3,29]],"date-time":"2008-03-29T14:14:04Z","timestamp":1206800044000},"page":"383-418","source":"Crossref","is-referenced-by-count":35,"title":["Pseudo-natural algorithms for the word problem for finitely presented monoids and groups"],"prefix":"10.1016","volume":"1","author":[{"given":"Klaus","family":"Madlener","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedrich","family":"Otto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(85)80022-5_bib1","first-page":"87","article-title":"Subrekursive Komplexit\u00e4t bei Gruppen","volume":"9","author":"Avenhaus","year":"1977","journal-title":"I. Gruppen mit vorgeschriebener Komplexit\u00e4t, Acta Inf."},{"key":"10.1016\/S0747-7171(85)80022-5_bib2","first-page":"183","article-title":"Subrekursive Komplexit\u00e4t bei Gruppen","volume":"9","author":"Avenhaus","year":"1978","journal-title":"II. Der Einbettungssatz von Higman f\u00fcr entscheidbare Gruppen. Acta Inf."},{"key":"10.1016\/S0747-7171(85)80022-5_bib3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02011863","article-title":"Algorithmische Probleme bei Einrelatorgruppen and ihre Komplexit\u00e4t, Arch. math.","volume":"19","author":"Avenhaus","year":"1978","journal-title":"Logik"},{"key":"10.1016\/S0747-7171(85)80022-5_bib4","article-title":"Zur Darstellung von Monoiden durch konfluente Regelsysteme","author":"Bauer","year":"1981","journal-title":"Doctoral dissertation, Universit\u00e4t Kaiserslautern"},{"key":"10.1016\/S0747-7171(85)80022-5_bib5","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 Inf."},{"key":"10.1016\/S0747-7171(85)80022-5_bib6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/322290.322301","article-title":"Confluent and other types of Thue systems","volume":"29","author":"Book","year":"1982","journal-title":"J. Assoc. Comp. Mach."},{"key":"10.1016\/S0747-7171(85)80022-5_bib7","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0304-3975(83)90005-1","article-title":"Decidable sentences of Church-Rosser congruences","volume":"24","author":"Book","year":"1983","journal-title":"Theor. Comp. Sci."},{"key":"10.1016\/S0747-7171(85)80022-5_bib8","series-title":"Progress in Combinatorics on Words","first-page":"1","article-title":"Thue systems and the Church-Rosser property: replacement systems, presentations of monoids, and specifications of formal languages","author":"Book","year":"1983"},{"key":"10.1016\/S0747-7171(85)80022-5_bib9","series-title":"Computer Algebra (Symbolic and Algebraic Computation), Computing Supplementum 4","article-title":"Algebraic simplification","author":"Buchberger","year":"1982"},{"key":"10.1016\/S0747-7171(85)80022-5_bib10","first-page":"39","article-title":"The word problem in polycyclic groups is elementary","volume":"27","author":"Cannonito","year":"1973","journal-title":"Camp. Math."},{"key":"10.1016\/S0747-7171(85)80022-5_bib11","series-title":"Computability and Unsolvability","author":"Davis","year":"1958"},{"key":"10.1016\/S0747-7171(85)80022-5_bib12","series-title":"Aerospace Report No. ATR-83(8478)-2, The Aerospace Corporation","article-title":"Applications of the Knuth-Bendix Completion Procedure","author":"Dershowitz","year":"1983"},{"key":"10.1016\/S0747-7171(85)80022-5_bib13","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(85)80022-5_bib14","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1002\/malq.19710170117","article-title":"Strong computability and variants of the uniform halting problem","volume":"17","author":"Herman","year":"1971","journal-title":"Zeitschr. f. math. Logik u. Grandl. d. Math."},{"key":"10.1016\/S0747-7171(85)80022-5_bib15","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1098\/rspa.1961.0132","article-title":"Subgroups of finitely presented groups","volume":"262","author":"Higman","year":"1961","journal-title":"Proc. Roy. Soc. London, Ser, A,"},{"key":"10.1016\/S0747-7171(85)80022-5_bib16","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(85)80022-5_bib17","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(85)80022-5_bib18","series-title":"Computational Problems in Abstract Algebra","article-title":"Simple word problems in universal algebras","author":"Knuth","year":"1970"},{"key":"10.1016\/S0747-7171(85)80022-5_bib19","series-title":"Semigroups and Combinatorial Applications","author":"Lallement","year":"1979"},{"key":"10.1016\/S0747-7171(85)80022-5_bib20","series-title":"Combinatorial Group Theory","author":"Lyndon","year":"1977"},{"key":"10.1016\/S0747-7171(85)80022-5_bib21","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0019-9958(74)80039-2","article-title":"The honest subrecursive classes are a lattice","volume":"24","author":"Machtey","year":"1974","journal-title":"Info. Control"},{"key":"10.1016\/S0747-7171(85)80022-5_bib22","article-title":"Encoding Complexities in Decision Problems of Finitely Presented Combinatorial Systems","author":"Madlener","year":"1982","journal-title":"Technical Report 57\/82, Fachbereich Informatik, Universit\u00e4t Kaiserslautern"},{"key":"10.1016\/S0747-7171(85)80022-5_bib23","article-title":"On the Quality of Pseudo-Natural Algorithms for the Word Problem","author":"Madlener","year":"1983","journal-title":"Technical Report 90\/83, Fachbereich Inforniatik, Universit\u00e4t Kaiserslautern"},{"key":"10.1016\/S0747-7171(85)80022-5_bib24","article-title":"On Finitely Generated Non-Finite Presentations of Groups and Monoids","author":"Madlener","year":"1983","journal-title":"Technical Report 91\/83, Fachbereich Informatik, Universit\u00e4t Kaiserslautern"},{"key":"10.1016\/S0747-7171(85)80022-5_bib25","article-title":"Pseudo-Natural Algorithms for Decision Problems in Certain Types of String-Rewriting Systems","author":"Madlener","year":"1984","journal-title":"Technical Report 113\/84, Fachbereich Informatik, Universit\u00e4t Kaiserslautern"},{"key":"10.1016\/S0747-7171(85)80022-5_bib26","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(85)80022-5_bib27","series-title":"Combinatorial Group Theory","author":"Magnus","year":"1976"},{"key":"10.1016\/S0747-7171(85)80022-5_bib28","series-title":"On Group-Theoretic Decision Problems and Their Classification","author":"Miller","year":"1971"},{"key":"10.1016\/S0747-7171(85)80022-5_bib29","series-title":"Congruences parfaites. Serninaire Dubrell, 25e Ann\/'ee, 1971-72, 7-01-09","author":"Nivat","year":"1971"},{"key":"10.1016\/S0747-7171(85)80022-5_bib30","article-title":"Untersuchungen zur Komplexit\u00e4t algorithntischer Probleme in abz\u00e4hlbar erzeugten Gruppen","author":"Otto","year":"1980","journal-title":"Doctoral dissertation, Universit\u00e4t Kaiserslautern"},{"key":"10.1016\/S0747-7171(85)80022-5_bib31","first-page":"341","article-title":"Computable algebra, general theory, and theory of computable fields","volume":"95","author":"Rabin","year":"1960","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0747-7171(85)80022-5_bib32","first-page":"359","article-title":"Complete and incomplete systems of reductions","volume":"57","author":"Richter","year":"1982","journal-title":"Informatik Fachberichte"},{"key":"10.1016\/S0747-7171(85)80022-5_bib33","series-title":"The Theory of Groups","author":"Rotman","year":"1984"},{"key":"10.1016\/S0747-7171(85)80022-5_bib34","article-title":"Machine configuration and word problems of given degree of unsolvability","author":"Shepherdson","year":"1965","journal-title":"Zeitschr."},{"key":"10.1016\/S0747-7171(85)80022-5_bib35","article-title":"Teilklassen primitiv-rekursiver Worfunktionen","author":"Weihrauch","year":"1974","journal-title":"Report No. 91, GMD Bonn"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717185800225?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717185800225?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,30]],"date-time":"2018-12-30T17:54:13Z","timestamp":1546192453000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717185800225"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,12]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,12]]}},"alternative-id":["S0747717185800225"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(85)80022-5","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1985,12]]}}}