论文信息 - On Real-Time Word Problems

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

Derek F. Holt | Claas E. Röver

[1] David E. Muller,et al. The Theory of Ends, Pushdown Automata, and Second-Order Logic , 1985, Theor. Comput. Sci..

[2] J. Hartmanis,et al. On the Computational Complexity of Algorithms , 1965 .

[3] R. Lyndon,et al. Combinatorial Group Theory , 1977 .

[4] Arnold L. Rosenberg,et al. Real-Time Definable Languages , 1967, JACM.

[5] David E. Muller,et al. Groups, the Theory of Ends, and Context-Free Languages , 1983, J. Comput. Syst. Sci..

[6] M. J. Dunwoody. The accessibility of finitely presented groups , 1985 .

[7] M. Rabin. Real time computation , 1963 .

[8] Derek F. Holt,et al. Solving the Word Problem in Real Time , 2001 .

[9] Arnold L. Rosenberg,et al. Real-time solutions of the origin-crossing problem , 2005, Mathematical systems theory.