Propositional STRIPS planning problems can be viewed as nite state automata (FSAs) represented in a factored form. Automaton minimization is a well-known technique for reducing the size of an explicit FSA. Recent work in computer-aided veriication on model checking has extended this technique to provide automaton minimization algorithms for fac-tored FSAs. In this paper, we consider the relatio...