1 paper
Thomas Erlebach, Kleitos Papadopoulos
The problem of constructing optimal factoring automata arises in the context of unification factoring for the efficient execution of logic programs. Given an ordered set of n str…