Pages that link to "Item:Q3040518"
From MaRDI portal
The following pages link to On Proving Uniform Termination and Restricted Termination of Rewriting Systems (Q3040518):
Displaying 20 items.
- Chain properties of rule closures (Q916402) (← links)
- Overlap closures do not suffice for termination of general term rewriting systems (Q922713) (← links)
- Loop detection in term rewriting using the eliminating unfoldings (Q944383) (← links)
- An \(O(| T| ^ 3)\) algorithm for testing the Church-Rosser property of Thue systems (Q1057263) (← links)
- A finite Thue system with decidable word problem and without equivalent finite canonical system (Q1073016) (← links)
- On recursive path ordering (Q1082075) (← links)
- Termination of rewriting (Q1098624) (← links)
- The Church-Rosser property for ground term-rewriting systems is decidable (Q1100890) (← links)
- On deciding the confluence of a finite string-rewriting system on a given congruence class (Q1102946) (← links)
- It is decidable whether a monadic thue system is canonical over a regular set (Q3210188) (← links)
- From Outermost Reduction Semantics to Abstract Machine (Q3453649) (← links)
- Deciding Innermost Loops (Q3522030) (← links)
- Loops under Strategies (Q3636816) (← links)
- Non-Looping String Rewriting (Q4718895) (← links)
- On relationship between term rewriting systems and regular tree languages (Q5055769) (← links)
- (Q5089023) (← links)
- Chain properties of rule closures (Q5096168) (← links)
- Meta-rule synthesis from crossed rewrite systems (Q5881274) (← links)
- Non-termination in Term Rewriting and Logic Programming (Q6493567) (← links)
- Optimizing term rewriting with creeper trace transducers (Q6615561) (← links)
