{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:10:21Z","timestamp":1742598621104,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540593409"},{"type":"electronic","value":"9783540492375"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59340-3_11","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:14:47Z","timestamp":1330276487000},"page":"135-153","source":"Crossref","is-referenced-by-count":0,"title":["A survey of symmetrized and complete group presentations"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Chenadec","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF01389320","volume":"72","author":"K.I. Appel","year":"1983","unstructured":"Appel K.I., Schupp P.E. Artin Groups and Infinite Coxeter Groups. Inv. Math., 72 (1983), 201\u2013220.","journal-title":"Inv. Math."},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/BF00271645","volume":"21","author":"G. Bauer","year":"1984","unstructured":"Bauer G., Otto F. Finite Complete Rewriting Systems and the Complexity of the Word Problem. Acta Inf. 21 (1984), 521\u2013540.","journal-title":"Acta Inf."},{"issue":"1","key":"11_CR3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/322290.322301","volume":"29","author":"R.V. Book","year":"1982","unstructured":"Book R.V. Confluent and other types of Thue Systems. J. of the ACM, 29, 1 (1982), 171\u2013182.","journal-title":"J. of the ACM"},{"key":"11_CR4","volume-title":"Groupes et alg\u00e8bres de Lie","author":"N. Bourbaki","year":"1978","unstructured":"Bourbaki N. Groupes et alg\u00e8bres de Lie, Ch. 4, 5 et 6. Hermann, Paris (1978)."},{"key":"11_CR5","unstructured":"B\u00fccken H. Reduktionssysteme und Wortproblem. Rhein.-Westf. Tech. Hochschule, Aachen, Inst. f\u00fcr Inf., Rep. 3 (1979)."},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1090\/S0025-5718-1973-0335610-5","volume":"27","author":"J.J. Cannon","year":"1973","unstructured":"Cannon J.J., Dimino L.A., Havas G., Watson J.M. Implementation and Analysis of the Todd-Coxeter Algorithm. Math. Comp. 27 (1973), 463\u2013490.","journal-title":"Math. Comp."},{"key":"11_CR7","unstructured":"Cannon J.W., Epstein D.B.A., Holt D.F., Paterson M.S., Thurston W.P. Word Processing and Group Theory. Unpublished research notes (1988)."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Cox D., Little J., O'Shea D. Ideals, Varieties and Algorithms. Springer-Verlag (1992).","DOI":"10.1007\/978-1-4757-2181-2"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Coxeter H.S.M., Moser W.O.J. Generators and Relations for Discrete Groups. Springer-Verlag, 4th ed. (1980).","DOI":"10.1007\/978-3-662-21943-0"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Dershowitz N., Jouannaud J.-P. Rewrite Systems. Ch. 6 of: Handbook of Theoretical Computer Science, Vol. B, J. van Leeuwen (ed.), Elsevier and MIT Press (1990), 243\u2013320.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"11_CR11","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1002\/cpa.3160130108","volume":"13","author":"M. Greendlinger","year":"1960","unstructured":"Greendlinger M. On Dehn's Algorithm for the Word Problem. Comm. Pure Appl. Math., 13 (1960), 67\u201383.","journal-title":"Comm. Pure Appl. Math."},{"issue":"1","key":"11_CR12","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0022-0000(81)90002-7","volume":"23","author":"G. Huet","year":"1981","unstructured":"Huet G. A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm. J. Comp. Syst. Sci. 23, 1 (1981), 11\u201321.","journal-title":"J. Comp. Syst. Sci."},{"key":"11_CR13","unstructured":"Hullot J.-M. Compilation de Formes Canoniques dans les Th\u00e9ories Equationnelles. Th\u00e8se, Univ. Paris-Sud (1980)."},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Knuth D.E., Bendix P. Simple Word Problems in Universal Algebras. in: Computational Problems in Abstract Algebra, Leech J. (ed.), Pergamon Press (1970), 263\u2013297.","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"11_CR15","volume-title":"Lecture Notes in Theo. Comp. Sci.","author":"P. Chenadec Le","year":"1986","unstructured":"Le Chenadec P. Canonical Forms in Finitely Presented Algebras and Application to Groups. Lecture Notes in Theo. Comp. Sci., Pitman-Wiley, London (1986)."},{"key":"11_CR16","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/S0747-7171(86)80004-9","volume":"2","author":"P. Chenadec Le","year":"1986","unstructured":"Le Chenadec P. A Catalogue of Complete Group Presentations. J. of Symb. Comp. 2 (1986), 363\u2013381.","journal-title":"J. of Symb. Comp."},{"key":"11_CR17","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(87)90048-X","volume":"51","author":"P. Chenadec Le","year":"1987","unstructured":"Le Chenadec P. Analysis of Dehn's Algorithm by Critical Pairs. Theor. Comp. Sci. 51 (1987), 27\u201352.","journal-title":"Theor. Comp. Sci."},{"key":"11_CR18","unstructured":"Lyndon R.C., Schupp P.E. Combinatorial Group Theory. Springer-Verlag (1977)."},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"March\u00e9 C. Normalised Rewriting and Normal Completion. Proc. LICS'94, IEEE Comp. Sci. Press (1994), 394\u2013403.","DOI":"10.1109\/LICS.1994.316050"},{"key":"11_CR20","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02392362","volume":"96","author":"H. Schiek","year":"1956","unstructured":"Schiek H. Ahnlichkeitsanalyse von Gruppenrelationen. Acta Math. 96 (1956), 157\u2013252.","journal-title":"Acta Math."},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Schupp P.E. A Survey of Small Cancellation Theory. in: Word Problems, W.W. Boone, F.B. Cannonito, R.C. Lyndon (eds.), North-Holland (1973), 569\u2013589.","DOI":"10.1016\/S0049-237X(08)71921-9"},{"key":"11_CR22","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0022-4049(87)90129-0","volume":"49","author":"C.G. Squier","year":"1987","unstructured":"Squier C.G. Word Problems and a Homological Finiteness Condition for Monoids. J. Pure Appl. Algebra 49 (1987), 201\u2013217.","journal-title":"J. Pure Appl. Algebra"},{"key":"11_CR23","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/B978-1-4832-2995-9.50013-1","volume-title":"Sympos. Math. Rome 1967\/68","author":"J. Tits","year":"1969","unstructured":"Tits J. Le Probl\u00e8me des Mots dans les Groupes de Coxeter. Sympos. Math. Rome 1967\/68, Academic Press, London (1969), 175\u2013185."},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Zieschang H., Vogt E., Coldeway D.-H. Surfaces and Planar Discontinuous Groups. Lecture Notes in Math., 835, Springer-Verlag (1980).","DOI":"10.1007\/BFb0089692"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59340-3_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:46:04Z","timestamp":1742597164000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59340-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540593409","9783540492375"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-59340-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}