The following pages link to (Q4808741):
Displayed 7 items.
- Reachability analysis over term rewriting systems (Q556686) (← links)
- Termination criteria for tree automata completion (Q730470) (← links)
- Bottom-up rewriting for words and terms (Q741256) (← links)
- Decidable call-by-need computations in term rewriting (Q1763429) (← links)
- Losing recognizability (Q2373716) (← links)
- Tree automata with equality constraints modulo equational theories (Q2426520) (← links)
- Tree automata for rewrite strategies (Q2456572) (← links)