Pages that link to "Item:Q2456572"
From MaRDI portal
The following pages link to Tree automata for rewrite strategies (Q2456572):
Displaying 9 items.
- Termination criteria for tree automata completion (Q730470) (← links)
- Bottom-up rewriting for words and terms (Q741256) (← links)
- Descendants of a recognizable tree language for sets of linear monadic term rewrite rules (Q845695) (← 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)
- Sequentiality, monadic second-order logic and tree automata. (Q1854333) (← links)
- Regular sets of descendants by leftmost strategy (Q2843614) (← links)
- Controlled Term Rewriting (Q3172893) (← links)
- Restarting Tree Automata (Q5448801) (← links)