The following pages link to Matchbox (Q22084):
Displayed 23 items.
- Termination of string rewriting proved automatically (Q850497) (← links)
- Termination proofs for string rewriting systems via inverse match-bounds (Q851146) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- Tyrolean termination tool: techniques and features (Q876042) (← links)
- On tree automata that certify termination of left-linear term rewriting systems (Q876043) (← links)
- Termination of just/fair computations in term rewriting (Q924727) (← links)
- Loop detection in term rewriting using the eliminating unfoldings (Q944383) (← links)
- Match-bounds revisited (Q1041044) (← links)
- Increasing interpretations (Q1044231) (← links)
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- Lower bounds for runtime complexity of term rewriting (Q2398176) (← links)
- Certifying confluence of quasi-decreasing strongly deterministic conditional term rewrite systems (Q2405266) (← links)
- Certification of Termination Proofs Using CeTA (Q3183545) (← links)
- On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices (Q3466259) (← links)
- (Q3515227) (← links)
- Termination of String Rewriting with Matrix Interpretations (Q3527305) (← links)
- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems (Q3540124) (← links)
- Matrix Interpretations for Proving Termination of Term Rewriting (Q3613435) (← links)
- Loops under Strategies (Q3636816) (← links)
- Transforming SAT into Termination of Rewriting (Q4982632) (← links)
- Implementation and Application of Automata (Q5463973) (← links)
- Frontiers of Combining Systems (Q5491901) (← links)
- Term Rewriting and Applications (Q5703861) (← links)