Skip to main content
Article thumbnail
Location of Repository

Solving the word problem in real time

By Derek F. Holt and Sarah Rees


The paper is devoted to the study of groups whose word problem can be solved by a Turing machine which operates in real time. A recent result of the first author for word hyperbolic groups is extended to prove that under certain conditions the generalised Dehn algorithms of Cannon, Goodman and Shapiro, which clearly run in linear time, can be programmed on real-time Turing machines. It follows that word-hyperbolic groups, finitely generated nilpotent groups and geometrically finite hyperbolic groups all have real-time word problems

Topics: QA
Publisher: Cambridge University Press
Year: 2001
OAI identifier:

Suggested articles


  1. (1995). Automatic structures, rational growth and geometrically ®nite hyperbolic groups', doi
  2. Dehn's algorithm for non-hyperbolic groups', preprint.solving the word problem in real time 639
  3. (1993). Geometrical ®niteness for hyperbolic groups', doi
  4. (1993). Group presentations, formal languages and characterizations of onecounter groups', doi
  5. (1967). Real-time de®nable languages', doi
  6. (1910). U $ ber die Topologie des dreidimensionalen Raumes', doi
  7. (1992). Word processing in groups (Jones and Bartlett,
  8. (2000). Word-hyperbolic groups have real-time word problem', doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.