Article contents
ON REAL-TIME WORD PROBLEMS
Published online by Cambridge University Press: 24 March 2003
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
- Copyright
- The London Mathematical Society 2003
- 1
- Cited by