Pages that link to "Item:Q1332338"
From MaRDI portal
The following pages link to Linearizing term rewriting systems using test sets (Q1332338):
Displaying 7 items.
- Using induction and rewriting to verify and complete parameterized specifications (Q672051) (← links)
- Deciding quasi-reducibility using witnessed test sets (Q1288435) (← links)
- Test sets for the universal and existential closure of regular tree languages. (Q1400712) (← links)
- Recognizable tree-languages and nonlinear morphisms (Q1603692) (← links)
- Linear size test sets for certain commutative languages (Q3149085) (← links)
- Towards an efficient construction of test sets for deciding ground reducibility (Q5055821) (← links)
- Computing linearizations using test sets (Q5881192) (← links)