REJECTED
Please predict whether this patent is acceptable.PATENT ABSTRACT: Techniques are provided herein for minimizing symbolic finite automata. The techniques for minimizing symbolic finite automata include the selection of a set of states, which may include a set of final states or a set of non-final states. By following the transitions from the selected states, techniques disclosed herein define partitions between various states of the SFA. Techniques are applied to the states in each partition to determine the states and state transitions of a minimized symbolic finite automaton. Techniques disclosed herein allow for the minimization of a symbolic finite automaton without the need to calculate minterms.