Pages that link to "Item:Q876043"
From MaRDI portal
The following pages link to On tree automata that certify termination of left-linear term rewriting systems (Q876043):
Displayed 5 items.
- Proving Quadratic Derivational Complexities Using Context Dependent Interpretations (Q3522024) (← links)
- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems (Q3540124) (← links)
- Automated Complexity Analysis Based on the Dependency Pair Method (Q3541717) (← links)
- From Outermost Termination to Innermost Termination (Q3599101) (← links)
- Increasing Interpretations (Q5505499) (← links)