Termination of String Rewriting with Matrix Interpretations
From MaRDI portal
Recommendations
Cited in
(25)- A complete characterization of termination of \(0^p1^q\to 1^r0^s\)
- Multi-dimensional interpretations for termination of term rewriting
- An automated approach to the Collatz conjecture
- Tuple interpretations for termination of term rewriting
- Real or natural number interpretation and their effect on complexity
- Proving termination of graph transformation systems using weighted type graphs over semirings
- Compression of rewriting systems for termination analysis
- Termination of cycle rewriting by transformation and matrix interpretation
- Weighted automata define a hierarchy of terminating string rewriting systems
- Improved matrix interpretation
- Arctic Termination ...Below Zero
- Matrix Interpretations for Proving Termination of Term Rewriting
- Automatic Termination
- scientific article; zbMATH DE number 2043544 (Why is no real title available?)
- Efficient completion of weighted automata
- Termination of cycle rewriting
- Word Matrix Rewriting Systems
- Transforming cycle rewriting into string rewriting
- Termination by Quasi-periodic Interpretations
- Lazy productivity via termination
- Proving Termination with (Boolean) Satisfaction
- An automated approach to the Collatz conjecture
- Termination of graph transformation systems using weighted subgraph counting
- Termination of string rewriting proved automatically
- Matrix interpretations for proving termination of term rewriting
This page was built for publication: Termination of String Rewriting with Matrix Interpretations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3527305)
