Artin groups of extra-large type are biautomatic

Journal of Pure and Applied Algebra

Volumn 110, Issue 1, 1996, Pages 15-56

  Peifer, David ^a  

^a UNIVERSITY OF NORTH CAROLINA AT ASHEVILLE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030575201     PISSN: 00224049     EISSN: None     Source Type: Journal    
DOI: 10.1016/0022-4049(95)00094-1     Document Type: Article

References (12)

1. [1] K.I. Appel, On Artin groups and Coxeter groups of large type, Contemp. Math. 33 (1984) 50-78.
2. [2] K.I. Appel and P.E. Schupp, Artin groups and infinite coxeter groups, Invent. Math. 72 (1983) 201-220.
3. [3] G. Baumslag, S. M. Gersten, M. Shapiro and H.B. Short, Automatic groups and amalgams, J. Pure. Appl. Algebra 76 (1991) 229-316.
4. [4] R. Charney, Artin groups of finite type are biautomatic, Math. Ann. 292 (1992) 671-683.
5. kij = 1, J. London Math. Soc. 10 (1935) 21-25.
6. [6] D.B.A. Epstein, J.W. Cannon, S.V.F. Levy, D.F. Holt, M.S. Paterson and W.P. Thurston, Word Processing in Groups (Jones and Bartkett, Boston, 1992).
7. [7] S.M. Gersten and H.B. Short, Small cancellation theory and automatic groups: part I, Invent. Math. 102 (1990) 305-334.
8. [8] S.M. Gersten and H.B. Short, Small cancellation theory and automatic groups: part II, Invent. Math. 105 (1991) 641-662.
9. [9] M. Gromov, S.M. Gersten, ed., in: Essays in Group Theory, (Springer, Berlin, 1987) 75-264.
10. [10] J.E. Hopcroft, and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, (Addison-Wesley, Reading, MA, 1979).
11. [11] R. Lyndon and P.E. Schupp, Combinatorial Group Theory (Springer, Berlin, 1977).
12. [12] P.E. Schupp, On Dehn's algorithm and the conjugacy problem, Math. Ann. 178 (1968) 119-130.