Simpler and More General Minimization for Weighted Finite-State Automata

Previous work on minimizing weighted finite-state automata (including transducers) is limited to particular types of weights. We present efficient new minimization algorithms that apply much more generally, while being simpler and about as fast. We also point out theoretical limits on minimization algorithms. We characterize the kind of “well-behaved” weight semirings where our methods work. Outside these semirings, minimization is not well-defined (in the sense of producing a unique minimal automaton), and even finding the minimum number of states is in general NP-complete and inapproximable.

• Type: Conference
• Year: 2003
• Where: NAACL
• Authors: Jason Eisner
• Keywords: Minimization Algorithms, NAACL 2003, NAACL 2007, Unique Minimal Automaton, Weighted finite-state Automata