Abstract: An apparatus and method, for use with a computer, for converting an uncompressed one-dimensional array of binary bits into a compressed binary bit string and/or for processing a Boolean operation on a first and a second compressed bit string. The first and second bit strings each contain one or more impulses. An impulse contains a run, which is a string of one or more bits of the same binary value, and an ending bit having a polarity opposite the polarity of the run. The impulses are encoded in one or more compressed impulse formats. Each compressed impulse format contains at least a first and a second indicator. The first indicator is for indicating the binary value of one or more same polarity bits of the run and the second indicator is for indicating the length of bits of the impulse. The length of bits is a quantity of the same polarity bits of the run and/or the ending bit having a polarity opposite the run.

Abstract: Method and apparatus are disclosed for determining a particular criterion value and an associated positional value for the degree of match between the juxtaposition of a plurality of events of a query and a plurality of corresponding events of a stored data base entry. Plural processors are utilized. Each processor includes a plurality of data stores and a temporary store for each data store. Each data store stores a group of data values. The data values are priorly formed and represent the number of event positions between the occurrence of events in the query and the occurrence of the corresponding events in the stored data base. The plural processors, working together using the plural data stores and the temporary stores, form determined data values and sum-of-distance values which are then used for deriving a criterion value and a positional value corresponding to the degree of match between the query and the data base.

Abstract: Method and means are disclosed for determining a particular criterion value and an associated positional value for a degree of match between the juxtaposition of a plurality of events of a query and a plurality of events of a stored data base entry. The method and means use a processing means having a plurality of data stores and a temporary store for each data store. Each data store stores a group of data values. The data values are priorly formed and represent the number of event positions between the occurrence of events in the query and the occurrence of the corresponding events in the stored data base. The processing means using the plurality data stores, the temporary stores and the data values stored therein form determined data values and sum-of-distance values which are then used by a utilizing means for in turn deriving a criterion value and a positional value corresponding to the degree of match between the query and the data base.

Abstract: Method and means using order of occurrence of entries and of events within entries for creating a data base and/or for finding a predetermined degree of match between the order of occurrence of events and entries in a request and a stored data base and/or for recreating an input in the original order of occurrence from a data base representing the order of occurrence of entries and events.

Abstract: An automatic sequencing circuit is disclosed which recognizes a particular coded input signal, initiates a process or data operation, and provides a coded output indicative of the operation performed. The circuit is particularly suited to hardware implementation of the control graph of a directed-graph design for any equipment using digital logic circuits.