Pages that link to "Item:Q2843614"
From MaRDI portal
The following pages link to Regular sets of descendants by leftmost strategy (Q2843614):
Displaying 7 items.
- Descendants of a recognizable tree language for sets of linear monadic term rewrite rules (Q845695) (← links)
- A theoretical limit for safety verification techniques with regular fix-point computations (Q963463) (← links)
- Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy (Q1637228) (← links)
- Over-approximating terms reachable by context-sensitive rewriting (Q1675159) (← links)
- Tree automata for rewrite strategies (Q2456572) (← links)
- (Q4808743) (← links)
- Handling Left-Quadratic Rules When Completing Tree Automata (Q4982086) (← links)