Pages that link to "Item:Q5055712"
From MaRDI portal
The following pages link to Computing ground reducibility and inductively complete positions (Q5055712):
Displaying 5 items.
- Using induction and rewriting to verify and complete parameterized specifications (Q672051) (← links)
- Testing for the ground (co-)reducibility property in term-rewriting systems (Q685352) (← links)
- Deductive and inductive synthesis of equational programs (Q1322836) (← links)
- Applying term rewriting methods to finite groups (Q5096205) (← links)
- Computing linearizations using test sets (Q5881192) (← links)
