On the algorithmic construction of classifying spaces and the isomorphism problem for biautomatic groups

We show that the isomorphism problem is solvable in the class of central extensions of word-hyperbolic groups, and that the isomorphism problem for biautomatic groups reduces to that for biautomatic groups with finite centre. We describe an algorithm that, given an arbitrary finite presentation of a...

詳細記述

書誌詳細
主要な著者: Bridson, M, Reeves, L
フォーマット: Journal article
言語:English
出版事項: 2011