The following pages link to (Q3077191):
Displaying 12 items.
- Finite sequentiality of unambiguous max-plus tree automata (Q2048206) (← links)
- Multi-dimensional interpretations for termination of term rewriting (Q2055861) (← links)
- An automated approach to the Collatz conjecture (Q2055879) (← links)
- Tuple interpretations for termination of term rewriting (Q2102931) (← links)
- Analyzing innermost runtime complexity of term rewriting by dependency pairs (Q2351155) (← links)
- Analyzing program termination and complexity automatically with \textsf{AProVE} (Q2362493) (← links)
- (Q2980968) (← links)
- (Q4395217) (← links)
- (Q5090506) (← links)
- A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems (Q5200041) (← links)
- An automated approach to the Collatz conjecture (Q6103589) (← links)
- Finite sequentiality of finitely ambiguous max-plus tree automata (Q6614608) (← links)
