[1] |
Caron, A.C.: Linear bounded automata and rewrite systems: influence of initial configuration on decision properties. Lecture notes in computer science 493, 74-89 (1991) · Zbl 0967.68523 |
[2] |
Dauchet, M.: Simulation of Turing machines by a left-linear rewrite rule. Lecture notes in computer science 355, 109-120 (1989) |
[3] |
Dauchet, M.: Simulation of Turing machines by a regular rule. Theoret. comput. Sci. 103, 409-420 (1992) · Zbl 0753.68052 |
[4] |
Hopcroft, J.E.; Ullman, J.D.: Introduction to automata theory, languages and computation. (1969) · Zbl 0196.01701 |
[5] |
Huet, G.; Lankford, D.S.: On the uniform halting problem for term rewriting systems. Tech. report 283 (1978) |
[6] |
Lewis, H.R.; Papadimitriou, Ch.H.: Elements of the theory of computation. (1981) · Zbl 0464.68001 |
[7] |
Middeldorp, A.; Gramlich, B.: Simple termination is difficult. Applicable algebra in engineering, communication and computation (1994) · Zbl 0815.68064 |
[8] |
Post, E.L.: Recursive unsolvability of a problem by thue. J. symbolic logic 12, No. 1, 1-11 (1947) · Zbl 1263.03030 |