Notions of hyperbolicity in monoids.

From MaRDI portal





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.











This page was built for publication: Notions of hyperbolicity in monoids.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q846368)