One-rule semi-thue systems with loops of length one, two or three

Theoretical Informatics and Applications

Volumn 30, Issue 5, 1996, Pages 415-429

  Kurth, Winfried ^a  

^a UNIVERSITY OF GÖTTINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 5844387837     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita/1996300504151     Document Type: Article

References (14)

1. H. ABDULRAB, Solving Word Equations, RAIRO Theo. Informatics and Appl., 1990, 24, pp. 109-130.
2. A. C. CARON, Linear Bounded Automata and Rewrite Systems: Influence of Initial Configurations on Decision Properties. Proceedings of TAPSOFT 91, April 8-12, 1991, Brighton, England, LNCS, 1991, 493, pp. 74-89.
3. M. DAUCHET, Termination of Rewriting is Undecidable in the One-rule Case. Proc. 13th Symposium MFCS, August 29-Sept. 2, 1988, Carlsbad, Czech., LNCS, 1988, 324, pp. 262-270.
4. N. DERSHOWITZ, Termination of Rewriting, J. Symbolic Computation, 1987, 3, pp. 69-116, and 1987, 4, pp. 409-410.
5. N. DERSHOWITZ, Termination of Rewriting, J. Symbolic Computation, 1987, 3, pp. 69-116, and 1987, 4, pp. 409-410.
6. C. KIRCHNER (Ed.), Rewriting Techniques and Applications, Proceedings of RTA-93, June 16-18, 1993, Montreal, Canada, LNCS, 1993, 690.
7. W. KURTH, Termination und Konfluenz von Semi-Thue-Systemen mit nur einer Regel, Dissertation, Technische Universität Clausthal, 1990.
8. G. LALLEMENT, On Monoids Presented by a Single Relation. J. Algebra, 1974, 32, pp. 370-388.
9. R. MCNAUGHTON, The Uniform Halting Problem for One-Rule Semi-Thue Systems, Rensselaer Polytechnic Institute, Report 94-18, August 1994.
10. R. MCNAUGHTON, Well Behaved Derivations in One-Rule Semi-Thue Systems, Rensselaer Polytechnic Institute, Report 95-15, November 1995.
11. Y. METIVIER, Calcul de Longueurs de Chaînes de Réécriture dans le Monoïde Libre, Theoretical Computer Science, 1985, 35, pp. 71-87.
12. P. NARENDRAN, C. O'DUNLAING and H. ROLLETSCHEK, Complexity of Certain Decision Problems About Congruential Languages, J. Computer Syst. Sci., 1985, 30, pp. 343-358.
13. F. OTTO, The Undecidability of Self-Embedding for Finite Semi-Thue and Thue Systems, Theoretical Computer Science, 1986, 47, pp. 225-232.
14. s. Proceedings of RTA-95, April 5-7, 1995, Kaiserslautern, Germany, LNCS, 1995, 914, pp. 41-55.