Notions of hyperbolicity in monoids.
In this very interesting paper, the authors introduce a notion of hyperbolicity in monoids which provides an efficient, \(O(n\log n)\) time, algorithm for solving the word problem. This notion restricts one suggested in earlier work by Duncan and Gilman. Here, the resulting hyperbolic monoids are shown to be biautomatic.
scientific article; zbMATH DE number 5667930
scientific article