On building minimal automaton for subset matching queries

Kimmo Fredriksson

We address the problem of building an index for a set $D$ of $n$ strings, where each string location is a subset of some finite integer alphabet of size $\sigma$, so that we can answer…