Pages that link to "Item:Q851146"
From MaRDI portal
The following pages link to Termination proofs for string rewriting systems via inverse match-bounds (Q851146):
Displaying 12 items.
- Match-bounds revisited (Q1041044) (← links)
- Match-bounded string rewriting systems (Q1762560) (← links)
- On prefixal one-rule string rewrite systems (Q2330116) (← links)
- Lower bounds for runtime complexity of term rewriting (Q2398176) (← links)
- Decidability of termination of grid string rewriting rules (Q2784496) (← links)
- Termination criteria for DPO transformations with injective matches (Q2867892) (← links)
- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems (Q3540124) (← links)
- Automatic Termination (Q3636815) (← links)
- (Q4255520) (← links)
- (Q4447248) (← links)
- On rationally controlled one-rule insertion systems (Q5044416) (← links)
- Implementation and Application of Automata (Q5463973) (← links)