| 摘要 |
PROBLEM TO BE SOLVED: To provide an FSA(finite state automaton) generating device which can decrease the total number of states of FSAs by dividing and/or putting the FSAs together and decrease the memory quantity regarding the storage of the FSAs by the decrease in the number of states. SOLUTION: Equivalent partial FSAs, i.e., a partial FSA which changes from a state 2 to a state 16 and a partial FSA which changes from a state 3 to a state 17 are extracted from one FSA (main1) changing from a state 1 to a state 18. Then the partial FSA is divided from the FSA (main1) and replaced with one state change. The equivalent partial FSA is divided as (sub1) and the part between the state 2 and state 16 of the (main1) is replaced with a symbol sub1 representing the partial FSA. Similarly, the part between the state 3 and state 17 of the (main1) is replaced with a symbol sub1 representing the partial FSA. Then the FSA having the symbol replaced is newly regarded as (main2). The sum of the number of states of the two divided FSs is 14 and less than that of the FSA (state number 18) before the division.
|
