Pages that link to "Item:Q3522008"
From MaRDI portal
The following pages link to Finer Is Better: Abstraction Refinement for Rewriting Approximations (Q3522008):
Displaying 6 items.
- Symbol different term rewrite systems (Q492918) (← links)
- Towards more precise rewriting approximations (Q2424681) (← links)
- Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems (Q2827837) (← links)
- TAGED Approximations for Temporal Properties Model-Checking (Q3637350) (← links)
- How to Tackle Integer Weighted Automata Positivity (Q3646253) (← links)
- Handling Left-Quadratic Rules When Completing Tree Automata (Q4982086) (← links)
