{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T07:44:46Z","timestamp":1648799086542},"reference-count":39,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1988,3,1]],"date-time":"1988-03-01T00:00:00Z","timestamp":573177600000},"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":9269,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1988,3]]},"DOI":"10.1016\/0304-3975(88)90134-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"253-275","source":"Crossref","is-referenced-by-count":3,"title":["Complexity, combinatorial group theory and the language of palutators"],"prefix":"10.1016","volume":"56","author":[{"given":"Carol","family":"Tretkoff","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90134-X_BIB1","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1007\/BF01071030","article-title":"Group languages","volume":"4","author":"Anisimov","year":"1974","journal-title":"Cybernetics"},{"key":"10.1016\/0304-3975(88)90134-X_BIB2","doi-asserted-by":"crossref","unstructured":"J. Autebert, L. Boasson and G. Senizergues, Groups and NTS Languages, J. Comput. System. Sci., to appear.","DOI":"10.1016\/0022-0000(87)90015-8"},{"key":"10.1016\/0304-3975(88)90134-X_BIB3","first-page":"63","article-title":"On groups defined by monadic Thue systems","author":"Avenhaus","year":"1983","journal-title":"Proc. Coll. on Algebra, Combinatorics, and Logic in Computer Science"},{"key":"10.1016\/0304-3975(88)90134-X_BIB4","unstructured":"J. Avenhaus, K. Madlener and F. Otto, Groups presented by finite two-monadic Church-Rosser Thue systems, Preprint."},{"key":"10.1016\/0304-3975(88)90134-X_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 Inform."},{"key":"10.1016\/0304-3975(88)90134-X_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. Comput. Mach."},{"key":"10.1016\/0304-3975(88)90134-X_BIB7","unstructured":"R. Book, Dehn's algorithm and the complexity of word problems, Preprint."},{"issue":"1","key":"10.1016\/0304-3975(88)90134-X_BIB8","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0747-7171(87)80021-4","article-title":"Thue systems as rewriting systems","volume":"3","author":"Book","year":"1987","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(88)90134-X_BIB9","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1090\/S0002-9904-1962-10745-9","article-title":"Some two-generator one-relator non-Hopfian groups","volume":"68","author":"Baumslag","year":"1962","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(88)90134-X_BIB10","doi-asserted-by":"crossref","first-page":"376","DOI":"10.2307\/2270453","article-title":"Hierarchies of computable groups and the word problem","volume":"31","author":"Cannonito","year":"1966","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(88)90134-X_BIB11","series-title":"Foundations of Computation Theory","first-page":"78","article-title":"The classification of problems which have fast parallel algorithms","volume":"158","author":"Cook","year":"1983"},{"issue":"1","key":"10.1016\/0304-3975(88)90134-X_BIB12","first-page":"29","article-title":"The complexity of two decision problems for free groups","volume":"8","author":"Domanski","year":"1982","journal-title":"Houston J. Math."},{"key":"10.1016\/0304-3975(88)90134-X_BIB13","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0304-3975(86)90117-9","article-title":"Complete semi-Thue systems for abelian groups","volume":"44","author":"Diekert","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(88)90134-X_BIB14","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0304-3975(86)90037-X","article-title":"Commutative monoids have complete presentations by free (non-commutative) monoids","volume":"46","author":"Diekert","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(88)90134-X_BIB15","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1016\/0196-6774(85)90031-8","article-title":"The complexity of Dehn's algorithm for word problems in groups","volume":"6","author":"Domanski","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(88)90134-X_BIB16","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/BF01388581","article-title":"The accessibility of finitely presented groups","volume":"81","author":"Dunwoody","year":"1985","journal-title":"Invent. Math."},{"key":"10.1016\/0304-3975(88)90134-X_BIB17","first-page":"113","article-title":"String matching and other products","volume":"7","author":"Fischer","year":"1974","journal-title":"SIAM-AMS Proc."},{"key":"10.1016\/0304-3975(88)90134-X_BIB18","first-page":"240","article-title":"Optimal parallel algorithms for string matching","author":"Galil","year":"1984","journal-title":"Proc. 16th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(88)90134-X_BIB19","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BFb0032843","article-title":"Computations with rational subsets of confluent groups","volume":"174","author":"Gilman","year":"1984","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/0304-3975(88)90134-X_BIB20","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/S0019-9958(65)90399-2","article-title":"One-tape, off-line Turing machine computations","volume":"8","author":"Hennie","year":"1965","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(88)90134-X_BIB21","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"issue":"2","key":"10.1016\/0304-3975(88)90134-X_BIB22","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","article-title":"Fast pattern matching in strings","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(88)90134-X_BIB23","series-title":"Research Notes in Theoretical Computer Science","article-title":"Canonical Forms in Finitely Presented Algebras","author":"Le Chenadec","year":"1986"},{"key":"10.1016\/0304-3975(88)90134-X_BIB24","series-title":"Combinatorial Group Theory","author":"Lyndon","year":"1977"},{"issue":"3","key":"10.1016\/0304-3975(88)90134-X_BIB25","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1145\/322017.322031","article-title":"Word problems solvable in logspace","volume":"24","author":"Lipton","year":"1977","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(88)90134-X_BIB26","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/S0747-7171(85)80022-5","article-title":"Pseudo-natural algorithms for finitely presented monoids and groups","volume":"1","author":"Madlener","year":"1985","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(88)90134-X_BIB27","first-page":"133","article-title":"Groups presented by certain classes of finite length-reducing string-rewriting system","volume":"256","author":"Madlener","year":"1987"},{"key":"10.1016\/0304-3975(88)90134-X_BIB28","series-title":"Combinatorial Group Theory","author":"Magnus","year":"1966"},{"key":"10.1016\/0304-3975(88)90134-X_BIB29","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0022-0000(83)90003-X","article-title":"Groups, the theory of ends, and context-free languages","volume":"26","author":"Muller","year":"1983","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(88)90134-X_BIB30","series-title":"Thesis","article-title":"Investigation of braid group algorithms","author":"Najarian","year":"1985"},{"key":"10.1016\/0304-3975(88)90134-X_BIB31","doi-asserted-by":"crossref","first-page":"172","DOI":"10.2307\/1969933","article-title":"Recursive unsolvability of group theoretic problems","volume":"67","author":"Rabin","year":"1958","journal-title":"Ann. of Math."},{"key":"10.1016\/0304-3975(88)90134-X_BIB32","series-title":"An Introduction to the Theory of Groups","author":"Rotman","year":"1984"},{"key":"10.1016\/0304-3975(88)90134-X_BIB33","doi-asserted-by":"crossref","unstructured":"C. Squier, Word problems and a homological finiteness condition for monoids, J. Pure Appl. Algebra, to appear.","DOI":"10.1016\/0022-4049(87)90129-0"},{"key":"10.1016\/0304-3975(88)90134-X_BIB34","first-page":"74","article-title":"The word problem for finitely presented monoids and finite canonical rewriting systems","volume":"256","author":"Squier","year":"1987"},{"key":"10.1016\/0304-3975(88)90134-X_BIB35","first-page":"347","article-title":"Bounded oracles and complexity classes inside linear space","volume":"223","author":"Tretkoff","year":"1986"},{"key":"10.1016\/0304-3975(88)90134-X_BIB36","series-title":"Proc. Mathematical Foundations of Computer Science","first-page":"432","article-title":"On polynomial reducibility of word problems under embedding of recursively presented groups in finitely presented groups","volume":"32","author":"Valiev","year":"1975"},{"key":"10.1016\/0304-3975(88)90134-X_BIB37","series-title":"Proc. Internat. Coll. on Automata Languages and Programming","first-page":"497","article-title":"Optimal parallel pattern matching in strings","volume":"194","author":"Vishkin","year":"1985"},{"key":"10.1016\/0304-3975(88)90134-X_BIB38","series-title":"Fundamentals of Computation Theory","first-page":"467","article-title":"Tape complexity of word problems","volume":"117","author":"Waack","year":"1981"},{"key":"10.1016\/0304-3975(88)90134-X_BIB39","first-page":"417","article-title":"Word problems for groups and context-free recognition","author":"Simon","year":"1979","journal-title":"Fundamentals of Computation Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758890134X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758890134X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:53:29Z","timestamp":1555127609000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439758890134X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,3]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,3]]}},"alternative-id":["030439758890134X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90134-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,3]]}}}