Complete characterization of termination of 0p 1q→1r 0s

Applicable Algebra in Engineering, Communications and Computing

Volumn 11, Issue 1, 2000, Pages 1-25

  Zantema, Hans ^a   Geser, Alfons ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b NONE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY;

STRING REWRITING; TERM REWRITING;

SET THEORY;

EID: 0033679246     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002009900019     Document Type: Article

References (39)

1. Adjan, S., Oganesjan, G.: Problems of equality and divisibility in semigroups with a single defining relation. Mat. Zametki, 41, 412-421 (1987)
2. Bachmair, L., Dershowitz, N.: Commutation, transformation, and termination. In: Siekmann, J. (ed.) Proc. 8th Int. Conf. Automated Deduction, Lecture Notes in Computer Science vol 230, pp. 5-20. Berlin Heidelberg New York: Springer 1986
3. Bellegarde, F., Lescanne, P.: Transformation ordering. In: 2nd TAPSOFT, pp. 69-80. Lecture Notes in Computer Science vol 249, Berlin Heidelberg New york: Springer 1987
4. Bellegarde, F., Lescanne, P.: Transformation ordering. In: 2nd TAPSOFT, pp. 69-80. Lecture Notes in Computer Science vol 249, Berlin Heidelberg New york: Springer 1987
5. Bellegarde, F., Lescanne, P.: Termination by completion. Applicable Algebra in Engineering, Communication and Computing, 1(2),79-96 (1990)
6. Book, R., Otto, F.: String-rewriting systems. Texts and Monographs in Computer Science. New York: Springer 1993
7. Dershowitz, N.: Orderings for term rewriting systems. Theor. Comput. Sci., 17(3), 279-301 (1982)
8. Dershowitz, N.: Termination of rewriting. J. Symb. Comput., 3(1&2), 69-115 (1987) Corrigendum: 4, 3, 409-410 (1987)
9. Dershowitz, N., Hoot, C.: Natural termination. Theor. Compu. Sci., 142(2), 179-207 (1995)
10. Ferreira, M., Zantema, H.: Dummy elimination: Making termination easier. In: Reichel, H. (ed.) Proc. 10th Conf. Fundamentals of Computation Theory, Lecture Notes in Computer Science Vol 965, pp. 243-252, Berlin Heidelberg New York: Springer 1995
11. Fokkink, W. J., Zantema, H.: Termination modulo equations by abstract commutation with an application to iteration. Theor. Compu. Sci., 177, 407-4123 (1997)
12. Geser, A.: Relative termination. Dissertation, Fakultät für Mathematik und Informatik, Universität Passau, D, 1990. Also available as: Report 91-03, Ulmer Informatik-Berichte, Universität Ulm, 1991. Available electronically via http://www-sr.informatik.uni-tuebingen.de/~geser/papers/diss.html.
13. Geser, A.: A note on normalizing, non-terminating one-rule string rewriting systems. Technical Report WSI 96-34, Universität Tübingen, D, October 1996. Accepted as a note in Theoretical Computer Science
14. Geser, A.: Termination of one-rule string rewriting systems script l sign → script r sign where |script r sign| ≤ 9. Technical report, Universität Tübingen, D, January 1998
15. Geser, A., Zantema, H.: Non-looping string rewriting. Theoret. Informatics Appl., 33, 279-301 (1999)
16. Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Mathematical Society, 2(7), 326-336 (1952)
17. Huet, G., Lankford, D. S.: On the uniform halting problem for term rewriting systems. Rapport Laboria 283, INRIA, 1978
18. Jantzen, M.: Confluent string rewriting, volume 14 of EATCS Monographs on Theoretical Computer Science. Berlin: Springer 1988
19. Kobayashi, Y., Katsura, M., Shikishima-Tsuji, K.: Termination and derivational complexity of confluent one-rule string rewriting systems. Technical report, Dept. of Computer Science, Toho University, JP 1997
20. Kurihara, M., Ohuchi, A.: Modularity of simple termination of term rewriting systems. Journal of IPS Japan, 31(5), 633-642 (1990)
21. Kurth, W.: Termination und Konfluenz von Semi-Thue-Systemen mit nur einer Regel. Dissertation, Technische Universität Clausthal, Germany 1990
22. Lankford, D. S.: On proving term rewriting systems are noetherian. Technical Report MTP-3, Louisiana Technical University, Ruston, 1979
23. Pierre Lescanne. Two implementations of the recursive path ordering on monadic terms. In: Proc. 19th Allerton House Conf. on Communication, Control, and Computing, pp. 634-643. Univ. Illinois Press, 1981
24. Matiyasevitch, Y., Sénizergues, G.: Decision problems for semi-Thue systems with a few rules. In IEEE Symp. Logic in Computer Science'96, 1996
25. McNaughton, R.: The uniform halting problem for one-rule Semi-Thue Systems. Technical Report 94-18, Dept. of Computer Science, Rensselaer Polytechnic Institute, Troy, NY, August 1994. See also "Correction to 'The Uniform Halting Problem for One-rule Semi-Thue Systems'", personal communication, August 1996
26. McNaughton, R.: The uniform halting problem for one-rule Semi-Thue Systems. Technical Report 94-18, Dept. of Computer Science, Rensselaer Polytechnic Institute, Troy, NY, August 1994. See also "Correction to 'The Uniform Halting Problem for One-rule Semi-Thue Systems'", personal communication, August 1996
27. McNaughton, R.: Well-behaved derivations in one-rule Semi-Thue Systems. Technical Report 95-15, Dept. of Computer Science, Rensselaer Polytechnic Institute, Troy, NY, November 1995
28. Meeussen, V., Zantema, H.: Derivation lengths in term rewriting from interpretations in the naturals. In: Wijshoff, H. A. (ed.) Computing Science in the Netherlands, pp. 249-260, November 1993. Also appeared as report RUU-CS-92-43, Utrecht University
29. Rosen, B. K.: Tree-manipulating systems and Church-Rosser Theorems. Journal of the ACM, 20(1), 160-187 (1973)
30. Sénizergues, G.: On the termination problem for one-rule semi-Thue systems. In RTA-96, Lecture Notes in Computer Science Vol. 1103, pp. 302-316. Berlin Heidelberg New York, Springer 1996
31. Tahhan-Bittar, E.: Non-erasing, right-linear orthogonal term rewrite systems, application to Zantema's problem. Technical Report RR2202, INRIA, France, 1994
32. Tahhan-Bittar, E.: Complexité linéaire du problème de Zantema. C. R. Acad. Sci. Paris Sér. I Inform. Théor., t. 323, 1201-1206 (1996)
33. Watier, G.: On the word problem for single relation monoids with an unbordered relator. International J. on Algebra and Computation. To appear
34. Watier, G.: Left-divisibility and word problems in single relation monoids. Semigroup Forum, 53, 194-207 (1996)
35. Wrathall, C.: Confluence of one-rule thue systems. In: Schulz, K. U. (ed.) Word equations and related topics, Lecture Notes in Computer Science Vol. 572. Berlin Heidelberg New York: Springer 1991
36. Zantema, H.: Termination of term rewriting: interpretation and type elimination. J. Symbol. Comput., 17, 23-50 (1994)
37. Zantema, H.: Termination of term rewriting by semantic labelling. Fundam. Inform., 24, 89-105 (1995)
38. s. In: Hsiang, J., (ed.) Proceedings of the 6th Conference on Rewriting Techniques and Applications. Lecture Notes in Computer Science Vol 914, p 41-55. Berlin Heidelberg New York: Springer 1995
39. Zantema, H., Geser, A.: Non-looping rewriting. Technical Report UU-CS-1996-03, Utrecht University, January 1996. Available via http://www.cs.ruu.nl/docs/ research/publication/TechList2.html.