ON REAL-TIME WORD PROBLEMS

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.