Patent Document ID: 8612376
Application ID: 12521636

Base Claim:
1. A finite automaton generation system comprising: an NFA conversion unit that increases a number of characters of a transition condition of a finite automaton which has a transition condition with a fixed number of characters, to any specified number of characters; and a result output unit that outputs a finite automaton that has a transition condition with the number of characters thereof increased to any specified number of characters, wherein said NFA conversion unit and the result output unit are configured out of hardware.

---

Claim 13:
13. The finite automaton generation system according to claim 1 , comprising: an NFA description matrix generation unit that converts a received regular expression to a matrix that describes a finite automaton having a one-character transition condition; an NFA description matrix storage unit that stores the matrix converted by the NFA description matrix generation unit; the NFA conversion unit that performs conversion in which a number of characters of a transition condition of the finite automaton, described by the matrix stored in the NFA description matrix storage unit, is increased; an NFA conversion result matrix storage unit that stores a finite automaton description matrix halfway-converted by the NFA conversion unit; and the result output unit that outputs a finite automaton that has the transition condition with a number of characters thereof increased to any specified number of characters.