The following pages link to (Q4808743):
Displaying 7 items.
- Reachability analysis over term rewriting systems (Q556686) (← links)
- Descendants of a recognizable tree language for sets of linear monadic term rewrite rules (Q845695) (← links)
- Over-approximating terms reachable by context-sensitive rewriting (Q1675159) (← links)
- Tree automata for rewrite strategies (Q2456572) (← links)
- Regular sets of descendants by leftmost strategy (Q2843614) (← links)
- (Q2980977) (← links)
- Reachability in Conditional Term Rewriting Systems (Q4916227) (← links)