Similar Items: Probabilistic Rewriting and Asymptotic Behaviour: on Termination and Unique Normal Forms
- From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
- Deciding Confluence and Normal Form Properties of Ground Term Rewrite Systems Efficiently
- Termination of Cycle Rewriting by Transformation and Matrix Interpretation
- Sound approximate and asymptotic probabilistic bisimulations for PCTL
- Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories
- Asymptotically almost all lambda-terms are strongly normalizing