This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Appel K.I., Schupp P.E. Artin Groups and Infinite Coxeter Groups. Inv. Math., 72 (1983), 201–220.
Bauer G., Otto F. Finite Complete Rewriting Systems and the Complexity of the Word Problem. Acta Inf. 21 (1984), 521–540.
Book R.V. Confluent and other types of Thue Systems. J. of the ACM, 29, 1 (1982), 171–182.
Bourbaki N. Groupes et algèbres de Lie, Ch. 4, 5 et 6. Hermann, Paris (1978).
Bücken H. Reduktionssysteme und Wortproblem. Rhein.-Westf. Tech. Hochschule, Aachen, Inst. für Inf., Rep. 3 (1979).
Cannon J.J., Dimino L.A., Havas G., Watson J.M. Implementation and Analysis of the Todd-Coxeter Algorithm. Math. Comp. 27 (1973), 463–490.
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).
Cox D., Little J., O'Shea D. Ideals, Varieties and Algorithms. Springer-Verlag (1992).
Coxeter H.S.M., Moser W.O.J. Generators and Relations for Discrete Groups. Springer-Verlag, 4th ed. (1980).
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–320.
Greendlinger M. On Dehn's Algorithm for the Word Problem. Comm. Pure Appl. Math., 13 (1960), 67–83.
Huet G. A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm. J. Comp. Syst. Sci. 23, 1 (1981), 11–21.
Hullot J.-M. Compilation de Formes Canoniques dans les Théories Equationnelles. Thèse, Univ. Paris-Sud (1980).
Knuth D.E., Bendix P. Simple Word Problems in Universal Algebras. in: Computational Problems in Abstract Algebra, Leech J. (ed.), Pergamon Press (1970), 263–297.
Le Chenadec P. Canonical Forms in Finitely Presented Algebras and Application to Groups. Lecture Notes in Theo. Comp. Sci., Pitman-Wiley, London (1986).
Le Chenadec P. A Catalogue of Complete Group Presentations. J. of Symb. Comp. 2 (1986), 363–381.
Le Chenadec P. Analysis of Dehn's Algorithm by Critical Pairs. Theor. Comp. Sci. 51 (1987), 27–52.
Lyndon R.C., Schupp P.E. Combinatorial Group Theory. Springer-Verlag (1977).
Marché C. Normalised Rewriting and Normal Completion. Proc. LICS'94, IEEE Comp. Sci. Press (1994), 394–403.
Schiek H. Ahnlichkeitsanalyse von Gruppenrelationen. Acta Math. 96 (1956), 157–252.
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–589.
Squier C.G. Word Problems and a Homological Finiteness Condition for Monoids. J. Pure Appl. Algebra 49 (1987), 201–217.
Tits J. Le Problème des Mots dans les Groupes de Coxeter. Sympos. Math. Rome 1967/68, Academic Press, London (1969), 175–185.
Zieschang H., Vogt E., Coldeway D.-H. Surfaces and Planar Discontinuous Groups. Lecture Notes in Math., 835, Springer-Verlag (1980).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Le Chenadec, P. (1995). A survey of symmetrized and complete group presentations. In: Comon, H., Jounnaud, JP. (eds) Term Rewriting. TCS School 1993. Lecture Notes in Computer Science, vol 909. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59340-3_11
Download citation
DOI: https://doi.org/10.1007/3-540-59340-3_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59340-9
Online ISBN: 978-3-540-49237-5
eBook Packages: Springer Book Archive