Their work bears some similarity to our algorithm in that partially overlapping state will be collapsed and efficiently handled together.
the key advatage to our approach is that groups have a score that can be used for pruning before the group is expanded, enabling pruning without first constructing the intersected automaton.