Pages that link to "Item:Q5055768"
From MaRDI portal
The following pages link to Bottom-up tree pushdown automata and rewrite systems (Q5055768):
Displaying 14 items.
- Termination criteria for tree automata completion (Q730470) (← links)
- Deterministic bottom-up tree transducers and ground term rewrite systems (Q1019744) (← links)
- Deterministic tree pushdown automata and monadic tree rewriting systems (Q1118421) (← links)
- Bottom-up tree pushdown automata: Classification and connection with rewrite systems (Q1325836) (← links)
- Tree automata for rewrite strategies (Q2456572) (← links)
- (Q3113675) (← links)
- (Q3976041) (← links)
- (Q4514551) (← links)
- (Q4547840) (← links)
- Bottom-Up Tree Automata with Term Constraints (Q4933333) (← links)
- (Q4964022) (← links)
- Handling Left-Quadratic Rules When Completing Tree Automata (Q4982086) (← links)
- Bottom-up tree pushdown automata and rewrite systems (Q5055768) (← links)
- Branching Pushdown Tree Automata (Q5386002) (← links)