Decidability of termination of grid string rewriting rules

SIAM Journal on Computing

Volumn 31, Issue 4, 2002, Pages 1156-1168

  Geser, Alfons ^a  

^a NASA LANGLEY RESEARCH CENTER   (United States)

Author keywords

Grid rule; One rule; Semi thue system; String rewriting system; Termination; Total division order

Indexed keywords

COMPUTATION THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING; TURING MACHINES;

DECIDABILITY; GRID STRING REWRITING RULES; SEMI-THUE SYSTEM; TOTAL DIVISION ORDER;

DECISION THEORY;

EID: 0036520279     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753979833297X     Document Type: Article

References (18)

1. The rationality of total division orderings
2. Simulation of turing machines by a regular rewrite rule
3. Ordering by divisibility in abstract algebras
4. Simple word problems in universal algebras
5. Termination and derivational complexity of confluent one-rule string rewriting systems
6. Termination und Konfluenz von Semi-Thue-Systemen mit nur Einer Regel
7. One-rule semi-Thue systems with loops of length one, two, or three
8. Two implementations of the recursive path ordering on monadic terms
9. Decision problems for semi-Thue systems with a few rules
10. The uniform halting problem for one-rule semi-thue systems
11. Well-behaved derivations in one-rule semi-thue systems
12. Calcul de longuers de chaînes de réécriture dans le monoïde libre
13. On the termination problem for one-rule semi-Thue systems
14. On termination of confluent one-rule string rewriting systems
15. Confluence of one-rule Thue systems
16. s
17. s