Location of Repository

On real-time word problems

By Derek F. Holt and Claas E. Röver

Abstract

It is proved that the word problem of the direct product of two free groups of rank 2 can be recognised by a 2-tape real-time but not by a 1-tape real-time Turing machine. It is also proved that the Baumslag–Solitar groups B(1,r) have the 5-tape real-time word problem for all r != 0

Topics: QA
Publisher: Cambridge University Press
Year: 2003
OAI identifier: oai:wrap.warwick.ac.uk:767

Suggested articles

Preview

Citations

  1. (1974). On k-tape versus (k − 1)-tape real time computation',
  2. Dehn's algorithm for non-hyperbolic groups', preprint,
  3. (1985). The accessibility of presented groups', doi
  4. (1968). Real-time solutions of the origin-crossing problem', doi
  5. (1990). Sur les groupes hyperboliques d'apr es Mikhael Gromov (Birkh¨ auser, doi
  6. (1965). On the computational complexity of algorithms', doi
  7. (2001). Solving the word problem in real time', doi
  8. (1977). Combinatorial group theory (Springer, doi
  9. (1983). Groups, the theory of ends, and context-free languages', doi
  10. (1985). The theory of ends, pushdown automata, and second-order logic', doi
  11. (1963). Real time computation', doi
  12. (1967). Real time de languages', doi

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