Pages that link to "Item:Q5055769"
From MaRDI portal
The following pages link to On relationship between term rewriting systems and regular tree languages (Q5055769):
Displaying 10 items.
- Solving divergence in Knuth--Bendix completion by enriching signatures (Q685379) (← links)
- Recognizable tree-languages and nonlinear morphisms (Q1603692) (← links)
- Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy (Q1637228) (← links)
- (Q3976041) (← links)
- On relationship between term rewriting systems and regular tree languages (Q5055769) (← links)
- Open problems in rewriting (Q5055780) (← links)
- Encompassment properties and automata with constraints (Q5055805) (← links)
- More problems in rewriting (Q5055812) (← links)
- Decidability of regularity and related properties of ground normal form languages (Q5881191) (← links)
- Computing linearizations using test sets (Q5881192) (← links)