Similar Items: Small Term Reachability and Related Problems for Terminating Term Rewriting Systems
- A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems
- From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
- Complexity of Conditional Term Rewriting
- Reachability Analysis of Innermost Rewriting
- Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity
- Modes of Convergence for Term Graph Rewriting