Small cancellation theory and automatic groups: Part II.
Inventiones mathematicae, Tome 105 (1991) no. 3, pp. 641-662
Cet article a éte moissonné depuis la source European Digital Mathematics Library
Mots-clés :
automatic groups, Cayley graph, generating set, words, regular language, free monoid, fundamental group, Euclidean 2-complex, Euclidean tesselations, finite presentation, small cancellation conditions, biautomatic group, solvable conjugacy problem
@article{IM_1991__105_3_143928,
author = {S.M. Gersten and H. Short},
title = {Small cancellation theory and automatic groups: {Part} {II.}},
journal = {Inventiones mathematicae},
pages = {641--662},
year = {1991},
volume = {105},
number = {3},
zbl = {0734.20014},
url = {http://geodesic.mathdoc.fr/item/IM_1991__105_3_143928/}
}
S.M. Gersten; H. Short. Small cancellation theory and automatic groups: Part II.. Inventiones mathematicae, Tome 105 (1991) no. 3, pp. 641-662. http://geodesic.mathdoc.fr/item/IM_1991__105_3_143928/