Finitely generated groups with automatic presentations (2008)
Graham P. Oliver, Richard M. Thomas
A structure is said to be computable if its domain can be represented by a set which is accepted by a Turing machine and if its relations can then be checked using Turing machines. Restricting the...