Match-bounds revisited
From MaRDI portal
Publication:1041044
DOI10.1016/j.ic.2009.02.010zbMath1192.68399MaRDI QIDQ1041044
Publication date: 27 November 2009
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2009.02.010
68Q42: Grammars and rewriting systems
Related Items
Beyond Dependency Graphs, CSI – A Confluence Tool, Reachability, confluence, and termination analysis with state-compatible automata
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Orderings for term-rewriting systems
- Termination of string rewriting proved automatically
- Termination proofs for string rewriting systems via inverse match-bounds
- Tyrolean termination tool: techniques and features
- On tree automata that certify termination of left-linear term rewriting systems
- Mechanizing and improving dependency pairs
- Decidability for left-linear growing term rewriting systems.
- Match-bounded string rewriting systems
- Termination of term rewriting using dependency pairs
- Automating the dependency pair method
- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
- Proving Termination of Rewrite Systems Using Bounds
- FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS
- Frontiers of Combining Systems
- Logic for Programming, Artificial Intelligence, and Reasoning