The following pages link to EXPANDER (Q34506):
Displaying 7 items.
- Test sets for the universal and existential closure of regular tree languages. (Q1400712) (← links)
- An upper bound on the derivational complexity of Knuth-Bendix orderings. (Q1401942) (← links)
- Swinging types=functions+relations+transition systems (Q1575635) (← links)
- Expander2: program verification between interaction and automation (Q2873787) (← links)
- Deduction and Declarative Programming (Q4023582) (← links)
- Generic induction proofs (Q5881185) (← links)
- A general framework to build contextual cover set induction provers (Q5950934) (← links)