Pages that link to "Item:Q850497"
From MaRDI portal
The following pages link to Termination of string rewriting proved automatically (Q850497):
Displaying 16 items.
- Termination of string rewriting proved automatically (Q850497) (← links)
- On tree automata that certify termination of left-linear term rewriting systems (Q876043) (← links)
- Mechanizing and improving dependency pairs (Q877836) (← links)
- Loop detection in term rewriting using the eliminating unfoldings (Q944383) (← links)
- Adding constants to string rewriting (Q945008) (← links)
- Match-bounds revisited (Q1041044) (← links)
- An automated approach to the Collatz conjecture (Q2055879) (← links)
- Lower bounds for runtime complexity of term rewriting (Q2398176) (← links)
- Proving Termination of Context-Sensitive Rewriting with MU-TERM (Q2867963) (← links)
- Deciding Innermost Loops (Q3522030) (← links)
- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems (Q3540124) (← links)
- A non-termination criterion for binary constraint logic programs (Q3621267) (← links)
- Loops under Strategies (Q3636816) (← links)
- (Q5089023) (← links)
- An automated approach to the Collatz conjecture (Q6103589) (← links)
- Non-termination in Term Rewriting and Logic Programming (Q6493567) (← links)
