Hostname: page-component-848d4c4894-x5gtn Total loading time: 0 Render date: 2024-05-24T06:45:51.902Z Has data issue: false hasContentIssue false
  • English
  • Français

ON REAL-TIME WORD PROBLEMS

Published online by Cambridge University Press:  24 March 2003

DEREK F. HOLT  and
CLAAS E. RÖVER
DEREK F. HOLT
Affiliation:
Mathematics Institute, University of Warwick, Coventry CV4 7AL dfh@maths.warwick.ac.uk
CLAAS E. RÖVER
Affiliation:
Department of Mathematics, University of Newcastle-upon-Tyne, Merz Court, Newcastle-upon-Tyne NE2 7RU c.h.e.w.roever@newcastle.ac.uk
Get access

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\neq 0$.

Type
Notes and Papers
Information
Journal of the London Mathematical Society , Volume 67 , Issue 2 , April 2003 , pp. 289 - 301
Copyright
The London Mathematical Society 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)