Max/Plus tree automata for termination of term rewriting
From MaRDI portal
Publication:3077191
Recommendations
Cited in
(21)- Analyzing program termination and complexity automatically with \textsf{AProVE}
- Tuple interpretations for termination of term rewriting
- Multi-dimensional interpretations for termination of term rewriting
- Certification of Proving Termination of Term Rewriting by Matrix Interpretations
- Automatic Termination
- Proving termination of graph transformation systems using weighted type graphs over semirings
- scientific article; zbMATH DE number 7559164 (Why is no real title available?)
- Complexity of conditional term rewriting
- Term Rewriting and Applications
- A dependency pair framework for innermost complexity analysis of term rewrite systems
- Finite sequentiality of finitely ambiguous max-plus tree automata
- Weighted automata for proving termination of string rewriting
- Finite sequentiality of unambiguous max-plus tree automata
- Analyzing innermost runtime complexity of term rewriting by dependency pairs
- An automated approach to the Collatz conjecture
- An automated approach to the Collatz conjecture
- scientific article; zbMATH DE number 1163641 (Why is no real title available?)
- Arctic Termination ...Below Zero
- On tree automata that certify termination of left-linear term rewriting systems
- Weighted automata define a hierarchy of terminating string rewriting systems
- Efficient completion of weighted automata
This page was built for publication: Max/Plus tree automata for termination of term rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3077191)
