Decision problems for semi-Thue systems with a few rules

Theoretical Computer Science

Volumn 330, Issue 1, 2005, Pages 145-169

  Matiyasevich, Yuri ^a   Sénizergues, Géraud ^b,c  

^a STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

^b UNIVERSITÉ DE BORDEAUX   (France)

^c UNIVERSITY OF STUTTGART   (Germany)

Author keywords

Accessibility; Bounds; Decidability; Post correspondence problem; Semi Thue system; Termination

Indexed keywords

ACCESSIBILITY; BOUNDS; POST CORRESPONDENCE PROBLEMS; SEMI-THUE SYSTEM; TERMINATION;

ALGORITHMS; FINITE ELEMENT METHOD; MATHEMATICAL TRANSFORMATIONS; NUMBER THEORY; PROBLEM SOLVING; SET THEORY;

COMPUTABILITY AND DECIDABILITY;

EID: 11444249695     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.09.016     Document Type: Article

References (42)

1. S.I. Adjan, G.S. Makanin, Investigations on algorithmic problems in algebra (in Russian), Trudy Mat. Inst. Steklov. 168 (1984) 197-217, English translation in Proceedings of the Steklov Institute of Mathematics, Vol. 168, 1986, pp. 207-226.
2. S.I. Adjan, G.S. Makanin, Investigations on algorithmic problems in algebra (in Russian), Trudy Mat. Inst. Steklov. 168 (1984) 197-217, English translation in Proceedings of the Steklov Institute of Mathematics, Vol. 168, 1986, pp. 207-226.
3. V.D. Blondel, and V. Canterini Undecidable problems for probabilistic automata of fixed dimension Theory Comput. Syst. 36 3 2003 231 245
4. R. Book, and F. Otto String Rewriting Systems, Texts and Monographs in Computer Science 1993 Springer Berlin
5. J. Cassaigne, T. Harju, and J. Karhumäki On the undecidability of freeness of matrix semigroups Internat. J. Algebra Comput. 9 3-4 1999 295 305
6. J. Cassaigne, and J. Karhumäki Examples of undecidable problems for 2-generator matrix semi-groups Theoret. Comput. Sci. 204 1998 29 34
7. V. Claus Some remarks on PCP(k) and related problems Bull. EATCS 12 1980 54 61
8. D.J. Collins Word and conjugacy problems in groups with only a few defining relations Z. Math. Logik Grundlag. Math. 15 4 1969 305 323
9. M. Dauchet Simulation of Turing machines by a left-linear rewrite rule in: Proceedings RTA 89, Lecture Notes in Computer Science Vol. 355 1989 Springer Berlin 109 120
10. M. Davis Computability and Unsolvability 1958 McGraw-Hill New York reprinted by Dover Publications, New York, 1982
11. N. Dershowitz Termination of rewriting J. Symbolic Comput. 3 1987 69 116
12. N. Dershowitz, and J.P. Jouannaud Rewrite Systems Handbook of Theoretical Computer Science Vol. B 1991 Elsevier Amsterdam 243 320 (Chapter 2)
13. A. Ehrenfeucht, J. Karhumäki, and G. Rozenberg The (generalized) Post correspondence problem with lists consisting of two words is decidable Theoret. Comput. Sci. 21 2 1982 119 144
14. A. Geser Decidability of termination of grid string rewriting rules SIAM J. Comput. 31 4 2002 1156 1168 (electronic)
15. A. Geser, A. Middeldorp, E. Ohlebusch, and H. Zantema Relative undecidability in term rewriting. I. The termination hierarchy Inform. and Comput. 178 1 2002 101 131
16. A. Geser, and H. Zantema Non-looping string rewriting Theor. Inform. Appl. 33 3 1999 279 301
17. V. Halava, T. Harju, and M. Hirvensalo Generalized Post correspondence problem for marked morphisms Internat. J. Algebra Comput. 10 6 2000 757 772
18. P. Hooper The undecidability of the Turing machine immortality problem J. Symbolic Logic 31 2 1966 219 234
19. G. Huet Confluent reductions abstract properties and applications to term rewriting systems J. Assoc. Comput. Mach. 27 4 1980 797 821
20. M. Jantzen, Confluent String Rewriting, EATCS Monograph, Vol. 14, Springer, Berlin, 1988.
21. Y. Kobayashi, M. Katsura, and K. Shikishima-Tsuji Termination and derivational complexity of confluent one-rule string-rewriting systems Theoret. Comput. Sci. 262 1-2 2001 583 632
22. W. Kurth One-rule semi-Thue systems with loops of length one two or three RAIRO Inform. Theor. Appl. 30 5 1996 415 429
23. G. Lallement The word problem for Thue rewriting systems Term Rewriting (Font Romeux, 1993), Lecture Notes in Computer Science Vol. 909 1995 Springer Berlin 27 38
24. A.A. Markov Impossibility of certain algorithms in the theory of associative systems Dokl. Akad. Nauk. SSSR 55 7 1947 587 590 (in Russian), reprinted in his Selected Papers, Vol. 2, MTsNMO Publisher, Moscow, 2003, pp. 3-7 (in Russian)
25. A.A. Markov Impossibility of certain algorithms in the theory of associative systems Dokl. Akad. Nauk. SSSR 58 1947 353 356 (in Russian), reprinted in his Selected Papers, Vol. 2, MTsNMO Publisher, Moscow, 2003, pp. 13-17 (in Russian)
26. Yu.V. Matiyasevich, Simple examples of undecidable associative calculi, Dokl. AN SSSR 173 (16) (in Russian), English translation in Soviet Math. Dokl. 8 (1967) 555-557.
27. Yu.V. Matiyasevich, Simple examples of undecidable associative calculi, Dokl. AN SSSR 173 (16) (in Russian), English translation in Soviet Math. Dokl. 8 (1967) 555-557.
28. Yu.V. Matiyasevich Simple examples of unsolvable canonical calculi Trudy Mat. Inst. Steklov 93 1967 50 88 (in Russian), English translation in Proc. Steklov Inst. Math. 93 (1967) 61-110
29. Yu.V. Matiyasevich On investigations on some algorithmic problems in algebra and number theory, Trudy Matematicheskogo instituta im. V. A. Steklova 168 1984 218 235 (in Russian), English translation in Proc. Steklov Inst. Math. 168(3) (1986) 227-252
30. Yu. Matiyasevich Word problem for Thue systems with a few relations, in: Term Rewriting (Font Romeux, 1993) Lecture Notes in Computer Science Vol. 909 1995 Springer Berlin 39 53
31. Yu. Matiyasevich, and G. Sénizergues Decision problems for semi-Thue systems with a few rules Lecture Notes in Computer Science Vol. 96 1996 IEEE Computer Society Press Silver Spring, MD 523 531
32. R. McNaughton Semi-Thue systems with an inhibitor J. Automat. Reason. 26 4 2001 409 431
33. E.L. Post Formal reductions of the general combinatorial decision problem Amer. J. Math. 65 1943 197 215
34. E.L. Post Recursive unsolvability of a problem of Thue J. Symbolic Logic 12 1 1947 1 11 reprinted in: M. Davis (Ed.), Solvability, Provability, Definability: The Collected Works of Emil L. Post, Birkhäuser, Boston a.o., 1994, pp. 503-513
35. G. Sénizergues Some undecidable termination problems for semi-Thue systems Theoret. Comput. Sci. 142 1995 257 276
36. G. Sénizergues, On the termination-problem for one-rule semi-Thue systems, in: RTA 96, Lecture Notes in Computer Science 1103 (1996) 302-316.
37. M. Steinby, and W. Thomas Trees and term rewriting in 1910 on a paper by Axel Thue Bull. Eur. Assoc. Theoret. Comput. Sci. EATCS (72) 2000 256 269
38. A. Thue. Probleme über veränderungen von zeichenreihen nach gegebenen regeln, Skr. Vid. Kristiania, I Mat. Naturv. Klasse 10 (1914) 34. Reprinted in his Selected Mathematical Papers, Universitetsforlaget, Oslo, 1977, pp. 493-524.
39. A. Thue. Probleme über veränderungen von zeichenreihen nach gegebenen regeln, Skr. Vid. Kristiania, I Mat. Naturv. Klasse 10 (1914) 34. Reprinted in his Selected Mathematical Papers, Universitetsforlaget, Oslo, 1977, pp. 493-524.
40. A. Thue, Die lösung eines spezialfalles eines generellen logichen problems, Kra. Videnskabs-Selskabets Skrifter. I. Mat. Nat. Kl.nr 8. Reprinted in his Selected Mathematical Papers, Universitetsforlaget, Oslo, 1977, pp. 273-310.
41. A. Thue, Die lösung eines spezialfalles eines generellen logichen problems, Kra. Videnskabs-Selskabets Skrifter. I. Mat. Nat. Kl.nr 8. Reprinted in his Selected Mathematical Papers, Universitetsforlaget, Oslo, 1977, pp. 273-310.
42. H. Zantema, and A. Geser A complete characterization of termination of 0 p 1 q → 1 r 0 s Appl. Algebra Eng. Comm. Comput. 11 1 2000 1 25