Termination and derivational complexity of confluent one-rule string-rewriting systems

Theoretical Computer Science

Volumn 262, Issue 1-2, 2001, Pages 583-632

  Kobayashi, Yuji ^a   Katsura, Masashi ^b   Shikishima Tsuji, Kayoko ^c  

^a TOHO UNIVERSITY   (Japan)

^b KYOTO SANGYO UNIVERSITY   (Japan)

^c TENRI UNIVERSITY   (Japan)

Author keywords

Derivation complexity; String rewriting system; Termination problem

Indexed keywords

PROBLEM SOLVING;

DERIVATIONAL COMPLEXITY; ONE RULE STRING REWRITING SYSTEMS; TERMINATION COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 0034923801     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00367-4     Document Type: Article

References (13)

1. Decision problems for semi-Thue systems with a few rules
2. The uniform halting problems for one-rule semi-Thue systems
3. Well behaved derivations in one-rule Semi-Thue systems
4. On the termination-problem for one-rule semi-Thue systems, Proc. RTA '96
5. On termination of confluent one-rule string-rewriting systems
6. Complexité linéaire du problème de Zantema
7. Rewrite systems for integer arithematic
8. Confluence of one-rule Thue systems
9. s