15. A finite automaton generation method, comprising: increasing a number of characters of a finite automaton transition condition which includes a transition condition with a fixed number of characters, to any specified number of characters; and outputting a finite automaton that has a transition condition with the number of characters thereof increased to any specified number of characters.
15. A finite automaton generation method, comprising: increasing a number of characters of a finite automaton transition condition which includes a transition condition with a fixed number of characters, to any specified number of characters; and outputting a finite automaton that has a transition condition with the number of characters thereof increased to any specified number of characters. 16. The finite automaton generation method according to claim 15 , comprising: storing a finite automaton that is described in a matrix form in advance and has a transition condition with a fixed number of characters; dividing the matrix, which describes the stored finite automaton, into a plurality of sub-matrices; performing conversion in which a number of characters of a transition condition of a new finite automaton is increased by using the plurality of divided sub-matrices; storing a halfway-converted finite automaton description matrix; storing a plurality of sub-matrices of the halfway-converted finite automaton description matrix; and outputting a finite automaton that has the transition condition with a number of characters thereof increased to any specified number of characters.