Covering Arrays for Equivalence Classes of Words

Joshua Cassels, Anant Godbole

Covering arrays for words of length $t$ over a $d$ letter alphabet are $k\times n$ arrays with entries from the alphabet so that for each choice of $t$ columns, each of the $d^t$…