Automatic Termination
From MaRDI portal
Publication:3636815
DOI10.1007/978-3-642-02348-4_1zbMath1242.68143OpenAlexW2912421483MaRDI QIDQ3636815
Publication date: 30 June 2009
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02348-4_1
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Termination of rewriting systems by polynomial interpretations and its implementation
- Deleting string rewriting systems preserve regularity
- Termination proofs for string rewriting systems via inverse match-bounds
- Weighted tree automata and weighted logics
- On tree automata that certify termination of left-linear term rewriting systems
- Matrix interpretations for proving termination of term rewriting
- Monadic Thue systems
- A complete characterization of termination of \(0^p1^q\to 1^r0^s\)
- Match-bounded string rewriting systems
- A Kleene theorem for weighted tree automata
- Peg-solitaire, string rewriting systems and finite automata
- Termination of term rewriting using dependency pairs
- Term rewriting and applications. 18th international conference, RTA 2007, Paris, France, June 26--28, 2007. Proceedings
- Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations
- Arctic Termination ...Below Zero
- Termination of String Rewriting with Matrix Interpretations
- Local Termination
- On semigroups of matrices over the tropical semiring
- Proving Termination of Rewrite Systems Using Bounds
- Termination by Quasi-periodic Interpretations
- Certification of Proving Termination of Term Rewriting by Matrix Interpretations
- FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS
- Theory and Applications of Satisfiability Testing
This page was built for publication: Automatic Termination
