Abstract
We introduce a notion of hyperbolicity in monoids which is a restriction of that suggested by Duncan and Gilman. One advantage is that the notion gives rise to efficient algorithms for dealing with certain questions; for example, the word problem can be solved in time \(\mathcal{O}(n \log n)\). We also introduce a new way of defining automatic monoids which provides a uniform framework for the discussion of these concepts.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alonso, J.M, Brady, T., Cooper, D., Ferlini, V., Lustig, M., Michalik, M., Shapiro, M., Short, H.: Notes on word hyperbolic groups. In: Ghys, E., Haefliger, A., Verjovsky, A. (eds.) Group Theory from a Geometric Viewpoint, pp. 3–63. World Scientific, Singapore (1991)
Duncan, A., Gilman, R.H.: Word hyperbolic semigroups. Math. Proc. Cambridge Philos. Soc. 136, 513–524 (2004)
Campbell, C.M., Robertson, E.F., Ruškuc, N., Thomas, R.M.: Automatic semigroups. Theoret. Comp. Sci. 250, 365–391 (2001)
Epstein, D.B.A., Cannon, J.W., Holt, D.F., Levy, S., Paterson, M.S., Thurston, W.: Word Processing in Groups. Jones & Barlett (1992)
Epstein, D.B.A., Holt, D.F.: The linearity of the conjugacy problem in word-hyperbolic groups. Internat. J. Algebra Comput. 16, 287–305 (2006)
Gilman, R.H.: On the definition of word hyperbolic groups. Math. Z. 242, 529–541 (2002)
Gromov, M.: Hyperbolic groups. In: Gersten, S.M. (ed.) Essays in Group Theory. MSRI Publ., Springer-Verlag, vol. 8, pp. 75–263 (1987)
Hoffmann, M., Kuske, D., Otto, F., Thomas, R.M.: Some relatives of automatic and hyperbolic groups. In: Gomes, G.M.S., Pin, J.-E., Silva, P.V. (eds.) Semigroups, Algorithms, Automata and Languages, pp. 379–406. World Scientific, Singapore (2002)
Hoffmann, M., Thomas, R.M.: Notions of automaticity in semigroups. Semigroup Forum 66, 337–367 (2003)
Hoffmann, M., Thomas, R.M.: Biautomatic semigroups. In: Liśkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 56–67. Springer, Heidelberg (2005)
Holt, D.F.: Word-hyperbolic groups have real-time word problem. Internat. J. Algebra Comput. 10, 221–227 (2000)
Hudson, J.F.P.: Regular rewrite systems and automatic structures. In: Almeida, J., Gomes, G.M.S., Silva, P.V. (eds.) Semigroups, Automata and Languages, pp. 145–152. World Scientific, Singapore (1998)
Otto, F., Sattler-Klein, A., Madlener, K.: Automatic monoids versus monoids with finite convergent presentations. In: Nipkow, T. (ed.) Rewriting Techniques and Applications. LNCS, vol. 1379, pp. 32–46. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoffmann, M., Thomas, R.M. (2007). Notions of Hyperbolicity in Monoids. In: Csuhaj-Varjú, E., Ésik, Z. (eds) Fundamentals of Computation Theory. FCT 2007. Lecture Notes in Computer Science, vol 4639. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74240-1_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-74240-1_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74239-5
Online ISBN: 978-3-540-74240-1
eBook Packages: Computer ScienceComputer Science (R0)