Pages that link to "Item:Q1762560"
From MaRDI portal
The following pages link to Match-bounded string rewriting systems (Q1762560):
Displaying 14 items.
- Bottom-up rewriting for words and terms (Q741256) (← links)
- Termination of string rewriting proved automatically (Q850497) (← links)
- Termination proofs for string rewriting systems via inverse match-bounds (Q851146) (← 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)
- Match-bounds revisited (Q1041044) (← links)
- On prefixal one-rule string rewrite systems (Q2330116) (← links)
- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems (Q3540124) (← links)
- Automatic Termination (Q3636815) (← links)
- Local Termination (Q3636830) (← links)
- On rationally controlled one-rule insertion systems (Q5044416) (← links)
- (Q5089023) (← links)
- Towards a Systematic Method for Proving Termination of Graph Transformation Systems (Q5403457) (← links)
