On the termination problem for one-rule semi-thue system

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1103, Issue , 1996, Pages 302-316

  Sénizergues, Géraud ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Automatic structure; Finite automata; Rational monoid; Semi thue systems; Termination

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; FINITE AUTOMATA;

AUTOMATIC STRUCTURES; LINEAR TIME COMPLEXITY; ONE-RULE SEMI-THUE SYSTEMS; RATIONAL MONOID; SEMI-THUE SYSTEM; TERMINATION; TERMINATION PROBLEMS;

ALGEBRA;

EID: 84957653056     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61464-8_61     Document Type: Conference Paper

References (14)

1. [Ber79] J. Berstel. Transductions and Context-Free Languages. Teubner, 1979.
2. [B093] R.V. Book and F. Otto. String Rewriting Systems. Texts and monographs in Computer Science. Springer-Verlag, 1993.
3. [Der87] N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation no S, pages 69-116, 1987.
4. [DH93] N. Dershowitz and C. Hoot. Topics in termination. In Proceedings of the 5th RTA, edited by C. Kirchner, pages 198-212. Springer,LNCS 690, 1993.
5. [DJ91] N. Dershowitz and J.P. Jouannaud. Rewrite Systems. In Handbook of theoretical computer science, vol.B, Chapter 2, pages 243-320. Elsevier, 1991.
6. +92] D.B.A. Epstein, J.W. Cannon, D.F. Holt, S.V.F. Levy, M.S. Paterson, and W.P. Thurston. Word processing in groups. Jones and Bartlett, 1992.
7. [Ges91] A. Geser. Relative termination. Report 91-03, Ulmer Informatik-Berichte, Universitãt Ulm, 1991.
8. [Kur90] W. Kurth. Termination und konfluenz von semi-Thue-systemen mit nur einer regel. Dissertation, Technische Universitãt Clausthal, 1990.
9. [McN94] R. McNaughton. The uniform halting problem for one-rule semi-Thue systems. Report 94-18 of Rensselaer Polytechnic Institute, 1994.
10. [MS96] Y. Matiyasevich and G. Sénizergues. Decision problems for semi-Thue systems with a few rules. To appear in the proceedings of LICS 96, 1996.
11. [PS90] M. Pelletier and J. Sakarovitch. Easy multiplications, II. extensions of rational semigroups. Information and Computation, pages 18-59, 1990.
12. [Sak87] J. Sakarovitch. Easy multiplications, I. the realm of kleene's theorem. Information and Computation, pages 173-197, 1987.
13. q → υ. In preparation, preliminary version available by email on request to: gesi@labri.u-bordeaux.fr, 1996.
14. s. In Proceedings RTA95, LNCS 914, pages 41-55. Springer-Verlag, 1995.