The following pages link to (Q2723905):
Displayed 25 items.
- Symbol different term rewrite systems (Q492918) (← links)
- Reachability analysis over term rewriting systems (Q556686) (← links)
- Termination criteria for tree automata completion (Q730470) (← links)
- Undecidable properties of flat term rewrite systems (Q734041) (← links)
- Descendants of a recognizable tree language for sets of linear monadic term rewrite rules (Q845695) (← links)
- Complete symbolic reachability analysis using back-and-forth narrowing (Q860885) (← links)
- Normalization properties for shallow TRS and innermost rewriting (Q964737) (← links)
- Murg term rewrite systems (Q975468) (← links)
- Decidability for left-linear growing term rewriting systems. (Q1400714) (← links)
- Term rewriting restricted to ground terms. (Q1401322) (← links)
- Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy (Q1637228) (← links)
- Decidable call-by-need computations in term rewriting (Q1763429) (← links)
- Context-sensitive rewriting strategies (Q1854569) (← links)
- Right-linear half-monadic term rewrite systems (Q1884902) (← links)
- Non-linear rewrite closure and weak normalization (Q2351264) (← links)
- Losing recognizability (Q2373716) (← links)
- Some decidability results on one-pass reductions (Q2423761) (← links)
- Tree automata for rewrite strategies (Q2456572) (← links)
- (Q2980977) (← links)
- Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems (Q3522018) (← links)
- Unique Normalization for Shallow TRS (Q3636819) (← links)
- TAGED Approximations for Temporal Properties Model-Checking (Q3637350) (← links)
- (Q4993342) (← links)
- Closure of Tree Automata Languages under Innermost Rewriting (Q5170159) (← links)
- (Q5240136) (← links)