Decision problems for word-hyperbolic semigroups

Alan James Cain, Markus Johannes Pfeiffer

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)
1 Downloads (Pure)


This paper studies decision problems for semigroups that are word-hyperbolic in the sense of Duncan & Gilman. A fundamental investigation reveals that the natural definition of a `word-hyperbolic structure' has to be strengthened slightly in order to define a unique semigroup up to isomorphism. The isomorphism problem is proven to be undecidable for word-hyperbolic semigroups (in contrast to the situation for word-hyperbolic groups). It is proved that it is undecidable whether a word-hyperbolic semigroup is automatic, asynchronously automatic, biautomatic, or asynchronously biautomatic. (These properties do not hold in general for word-hyperbolic semigroups.) It is proved that the uniform word problem for word-hyperbolic semigroup is solvable in polynomial time (improving on the previous exponential-time algorithm). Algorithms are presented for deciding whether a word-hyperbolic semigroup is a monoid, a group, a completely simple semigroup, a Clifford semigroup, or a free semigroup.
Original languageEnglish
Pages (from-to)287-321
JournalJournal of Algebra
Early online date22 Jul 2016
Publication statusPublished - 1 Nov 2016


  • Word-hyperbolic semigroups
  • Decision problems
  • Undecidability
  • Isomorphism problem
  • Context-free languages


Dive into the research topics of 'Decision problems for word-hyperbolic semigroups'. Together they form a unique fingerprint.

Cite this