Termination of single-threaded one-rule Semi-Thue Systems

Lecture Notes in Computer Science

Volumn 3467, Issue , 2005, Pages 338-352

  Moczydłowski, Wojciech ^a   Geser, Alfons ^b  

^a School of Operations Research and Information Engineering   (United States)

^b National Institute for Aerospace   (United States)

Author keywords

One rule; Semi thue system; Single rule; Single threaded; String rewriting; Termination; Uniform termination; Well be haved

Indexed keywords

COMPUTABILITY AND DECIDABILITY; INFORMATION RETRIEVAL SYSTEMS; PROBLEM SOLVING; TECHNICAL WRITING;

ONE-RULE; SEMI-THUE SYSTEMS; SINGLE-RULE; SINGLE-THREADED; STRING REWRITING; TERMINATION; UNIFORM TERMINATION; WELL-BEHAVED;

COMPUTER SCIENCE;

EID: 24944558138     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-32033-3_25     Document Type: Conference Paper

References (12)

1. Ronald Book and Friedrich Otto. String-rewriting systems. Texts and Monographs in Computer Science. Springer, New York, 1993.
2. Alfons Geser. Is termination decidable for string rewriting with only one rule? Habilitation thesis, Wilhelm-Schickard-Institut, Universität Tübingen, Germany, January 2002. 201 pages.
3. Alfons Geser, Dieter Hofbauer, and Johannes Waldmann. Termination proofs for string rewriting systems via inverse match-bounds. J. Automated Reasoning, 2005. In print.
4. Yuji Kobayashi, Masashi Katsura, and Kayoko Shikishima-Tsuji. Termination and derivational complexity of confluent one-rule string rewriting systems. Theoretical Computer Science, 262(1/2):583-632, 2001.
5. Winfried Kurth. Termination und Konfluenz von Semi-Thue-Systemen mit nur einer Regel. Dissertation, Technische Universität Clausthal, Germany, 1990.
6. Robert McNaughton. 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'", unpublished paper, August, 1996.
7. Robert McNaughton. Well-behaved derivations in one-rule Semi-Thue Systems. Technical Report 95-15, Dept. of Computer Science, Rensselaer Polytechnic Institute, Troy, NY, November 1995. See also "Correction by the author to 'Well-behaved derivations in one-rule Semi-Thue Systems'", unpublished paper, July, 1996.
8. Robert McNaughton. Semi-Thue Systems with an Inhibitor. J. Automated Reasoning, 26:409-431, 1997.
9. Wojciech Moczydłowski. Jednoregułowe systemy przepisywania słów. Masters thesis, Warsaw University, Poland, 2002.
10. Wojciech Moczydłowski and Alfons Geser. Termination of single-threaded one-rule Semi-Thue systems. Technical Report TR 02-08 (273), Warsaw University, December 2002. Available electronically at URL research.nianet.org/~geser/papers/single.html.
11. Arto Salomaa. Theory of Automata, volume 100 of Intl. Series of Monographs in Pure and Applied Mathematics. Pergamon Press, 1969.
12. J. V. Tucker. Computing in algebraic systems. In F. F. Drake and S. S. Wainer, editors, Recursion Theory, its Generalisations and Applications, volume 45 of London Mathematical Society Lecture Note Series, pages 215-235. Cambridge University Press, 1980.