17. A system for detecting matches between strings of input characters from a database and one or more patterns, each pattern comprising elements consisting of tokens, employing a finite state automaton, responsive to said strings of input characters, comprising a plurality of character matchers acting in concert; each character matcher being characterized as capable of existing in one of a plurality of states, each such state having (a) one token from a pattern, to be compared against a current input character, (b) first instructions, which govern transitions to the next state of said character matcher, and (c) second instructions, which force other character matchers into specified states, each character matcher being responsive to one or more memories, comprising control words and storing tokens and instructions for a particular state; each character matcher being further characterized as having at least an initial state, to be occupied by said character matcher at the start of the matching procedure, and an idle state, to be occupied by said character matcher after an unsuccessful comparison between the token specified in the current state of said character matcher and the current input character; the respective states being partitioned among said character matchers to avoid any sequence of input characters requiring any character matcher to be simultaneously in more than one state; said system, for each string of input characters to be matched and a corresponding character matcher, comprising: (a) reading means, for reading said input characters from said database; (b) comparison means, for sequentially comparing each input character against the token associated with the current state of said character matcher; (c) determinant means, for determining a succeeding state of said character matcher based on a successful comparison of the current input character against the token specified in said character matcher's current state; and (d) forcing means, operative for said character matcher to force other character matchers into specified states.
17. A system for detecting matches between strings of input characters from a database and one or more patterns, each pattern comprising elements consisting of tokens, employing a finite state automaton, responsive to said strings of input characters, comprising a plurality of character matchers acting in concert; each character matcher being characterized as capable of existing in one of a plurality of states, each such state having (a) one token from a pattern, to be compared against a current input character, (b) first instructions, which govern transitions to the next state of said character matcher, and (c) second instructions, which force other character matchers into specified states, each character matcher being responsive to one or more memories, comprising control words and storing tokens and instructions for a particular state; each character matcher being further characterized as having at least an initial state, to be occupied by said character matcher at the start of the matching procedure, and an idle state, to be occupied by said character matcher after an unsuccessful comparison between the token specified in the current state of said character matcher and the current input character; the respective states being partitioned among said character matchers to avoid any sequence of input characters requiring any character matcher to be simultaneously in more than one state; said system, for each string of input characters to be matched and a corresponding character matcher, comprising: (a) reading means, for reading said input characters from said database; (b) comparison means, for sequentially comparing each input character against the token associated with the current state of said character matcher; (c) determinant means, for determining a succeeding state of said character matcher based on a successful comparison of the current input character against the token specified in said character matcher's current state; and (d) forcing means, operative for said character matcher to force other character matchers into specified states. 20. The system of claim 17 wherein said database is stored in a serial access memory device.