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):
Displaying 15 items.
- Symbol different term rewrite systems (Q492918) (← links)
- Reachability, confluence, and termination analysis with state-compatible automata (Q515687) (← links)
- Match-bounds revisited (Q1041044) (← links)
- Increasing interpretations (Q1044231) (← links)
- Analyzing innermost runtime complexity of term rewriting by dependency pairs (Q2351155) (← links)
- (Q2980968) (← links)
- Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems (Q3014928) (← links)
- 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)
- Automatic Termination (Q3636815) (← links)
- Beyond Dependency Graphs (Q5191112) (← links)
- A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems (Q5200041) (← links)
- Increasing Interpretations (Q5505499) (← links)
