Similar Items: From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
- Reachability Analysis of Innermost Rewriting
- Modular Complexity Analysis for Term Rewriting
- Probabilistic Rewriting and Asymptotic Behaviour: on Termination and Unique Normal Forms
- Small Term Reachability and Related Problems for Terminating Term Rewriting Systems
- Complexity of Conditional Term Rewriting
- A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems