| 摘要 |
<P>PROBLEM TO BE SOLVED: To provide an information processor, an information processing method, and a program capable of reducing the number of deterministic finite state automatons progressively without using any large storage area. <P>SOLUTION: States composing deterministic finite automaton are classified for each state where an input signal accompanying an outgoing transition and an ending property are equal. A search section calculates a product set by regarding a set of a transition destination state of states included in the product set as a set of a new state until the size of the product set with the set of the transition destination state of each state decreases to 1 or below, and merges a plurality of states that cannot be distinguished mutually into one state while reversely tracking a transition direction taken by the search section. <P>COPYRIGHT: (C)2010,JPO&INPIT |
