3. The method of claim 2 , wherein generating the output finite-state machine includes generating a plurality of composite finite-state machines by convolving each of the input finite-state machines by applying at least one of the encoding methods in the set of encoding methods to each of a plurality of transition characters in the input finite-state machine.
3. The method of claim 2 , wherein generating the output finite-state machine includes generating a plurality of composite finite-state machines by convolving each of the input finite-state machines by applying at least one of the encoding methods in the set of encoding methods to each of a plurality of transition characters in the input finite-state machine. 4. The method of claim 3 wherein generating the output finite-state machine further includes summing the plurality of composite finite-state machines to generate a non-deterministic finite-state machine.