Pseudo-natural algorithms for finitely generated presentations of monoids and groups

Klaus Madlener, Friedrich Otto
1988 Journal of symbolic computation  
Let G be a finitely generated group such that the word problem for G is E.-decidable for some n ~> 1. Then there exists a finitely getterated context-sensitive presentation of G such that the word problem for this presentation can be solved by a pseudo-natural algorithm in the class E". This result cannot be strengthened to always yield a context-free presentation. However, it can be extended to hold for finitely generated monoids as well.
doi:10.1016/s0747-7171(88)80034-8 fatcat:ujwmpjagzfeqnpqclh75iaypjm