Pages that link to "Item:Q730470"
From MaRDI portal
The following pages link to Termination criteria for tree automata completion (Q730470):
Displaying 8 items.
- Multi-completion with termination tools (Q352956) (← links)
- Reachability, confluence, and termination analysis with state-compatible automata (Q515687) (← links)
- Equational approximations for tree automata completion (Q968530) (← links)
- Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy (Q1637228) (← links)
- Pattern eliminating transformations (Q2119103) (← links)
- Some decidability results on one-pass reductions (Q2423761) (← links)
- (Q2980977) (← links)
- Completeness of tree automata completion (Q4993342) (← links)