(2025). From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity. Logical Methods in Computer Science.
Successfully copied to clipboard
Copying to clipboard failed
Chicago Style (17th ed.) Citation
"From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity."
Logical Methods in Computer Science 2025.
Successfully copied to clipboard
Copying to clipboard failed
MLA (9th ed.) Citation
"From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity."
Logical Methods in Computer Science, 2025.
Successfully copied to clipboard
Copying to clipboard failed
Warning: These citations may not always be 100% accurate.