This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B. Benninghofen, S. Kemmerich, M. M. Richter, Systems of Reductions, Lecture Notes in Computer Science 277, Springer Verlag, Berlin 1987.
M. Bridson and R. Gilman, Formal language theory and the geometry of 3-manifolds, to appear.
G. Buntrock and K. Lorys, On growing context-sensitive languages, 19th ICALP, Lecture Notes in Computer Science 623, Springer Verlag, Berlin 1992, 77–88.
M. Coornaert, T. Delzant, and A. Papadopoulos, Géométrie et théorie des groupes, Lecture Notes in Mathematics 1441, Springer Verlag, Berlin 1990.
D. B. A. Epstein, J. W. Cannon, D. F. Holt, S. V. F. Levy, M. S. Paterson, and W. P. Thurston, Word Processing in Groups, Jones and Bartlett, Boston 1992.
D. B. A. Epstein, D. F. Holt, and S. Rees, The use of Knuth Bendix methods to solve the word problem in automatic groups, J. Symbolic Computation 12 1991, 397–414.
C. Frougny and J. Sakarovitch, Synchronized rational relations of finite and infinite words, Theoretical Computer Science 108 1993, 45–82.
S. M. Gersten and H. B. Short, Rational subgroups of biautomatic groups, Annals of Mathematics 134 1991, 125–158.
E. Ghys and P. de la Harpe eds., Sur les Groupes Hyperboliques d'apres Mikhael Gromov, Birkhäuser, Boston 1990.
R. Gilman, Presentations of groups and monoids, J. Algebra 57 1979, 544–554.
M. Gromov, Hyperbolic groups, in Essays in Group Theory, S. M. Gersten ed., MSRI Publ. 8, Springer Verlag, New York 1987, 75–263.
M. Jantzen, Confluent String Rewriting, EATCS Monographs on Theoretical Computer Science 14, Springer Verlag, Berlin 1988.
K. Madlener and F. Otto, Groups presented by certain classes of finite length-reducing string rewriting systems, Lecture Notes in Computer Science 256, Springer Verlag, Berlin 1987, 133–144.
D. Muller and P. Schupp, Groups, the theory of ends and context-free languages, J. Computer and System Sciences 26 1983, 295–310.
R. Needham, Term rewriting and the word problem for certain infinite presentations of groups, Dissertation, University of Michigan 1992.
C. O'Dunlaing, Infinite regular Thue systems, Theor. Comp. Sci. 25 1983, 171–192.
P. Papasoglu, Geometric methods in group theory, Dissertation, Columbia Univ., 1993
G. P. Scott, The geometries of 3-manifolds, Bulletin of the London Mathematical Society, 15 1983, 401–487.
C. Sims, Computation with Finitely Presented Groups Encyclopedia of Math. and Its Applications 48, Cambridge Univ. Pr. 1994.
R. Strebel, Small cancellation groups, in Sur les Groupes Hyperboliques d'apres Mikhael Gromov, E. Ghys and P. de la Harpe eds., Birkhäuser, Boston 1990, 227–273.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gilman, R.H. (1995). Automatic groups and string rewriting. 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_10
Download citation
DOI: https://doi.org/10.1007/3-540-59340-3_10
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