5. The integrated circuit chip of claim 4 , coupled to the PRISM compiler, said PRISM compiler further comprising means to compile a first set of said signature pattern rules in data structure for programming into said one or more signature search engines and further comprising means to compile a second set of said signature pattern rules into a set of programmable finite state automata for programming in the said one or more programmable FSA rule memory circuits, said second set of said signature pattern rules comprising signatures with length less than a predetermined number of characters.
5. The integrated circuit chip of claim 4 , coupled to the PRISM compiler, said PRISM compiler further comprising means to compile a first set of said signature pattern rules in data structure for programming into said one or more signature search engines and further comprising means to compile a second set of said signature pattern rules into a set of programmable finite state automata for programming in the said one or more programmable FSA rule memory circuits, said second set of said signature pattern rules comprising signatures with length less than a predetermined number of characters. 6. The integrated circuit chip of claim 5 , wherein the programmable intelligent search memory for content search uses one or more regular expressions, said programmable intelligent search memory comprising a symbol memory circuit for storing symbols; a state dependent vector memory circuit for storing state transition controls; an initial vector memory circuit for storing initial vector; and an accept state vector memory circuit for storing an accept state vector, said PRISM memory further comprising an array of randomly accessible PRISM memory locations to access the said one or more programmable finite state automata memory circuits, said one or more regular expressions comprising one or more symbols or characters, said one or more regular expressions compiled by said PRISM compiler into said one or more programmable finite state automata data structure representing the functionality of the said one or more regular expressions for programming in the said programmable intelligent search memory, said one or more finite state automata comprising a plurality of states, said plurality of states derived from the said one or more symbols of the said one or more regular expressions, said content comprising one or more input symbols provided as input to the said programmable intelligent search memory, said programmable intelligent search memory compiler to generate said one or more programmable finite state automata comprising at least one of each of: a. a symbol representing at least one of the said one or more symbols for programming in the said symbol memory circuit; b. a state dependent vector representing state transition controls for programming in said state dependent vector memory circuit; c. an initial state vector to represent at least one initial state for programming in the said initial state vector memory circuit; and d. an accept state vector to represent at least one accept state for programming in the said accept state vector memory circuit.