EFFICIENT STORAGE FOR FINITE STATE MACHINES
First Claim
Patent Images
1. A method of operating a storage of a finite state machine, the method comprising:
- organizing information concerning an operation of the machine in a payload-transition matrix, in which a given number of columns of the matrix reflect features of a state of the machine and other columns describe valid transitions between the states of the machine depending on input characters; and
compressing the payload-transition matrix in a row-displaced format.
1 Assignment
0 Petitions
Accused Products
Abstract
A method of operating a storage of a finite state machine includes organizing information concerning an operation of the machine in a payload-transition matrix, in which a given number of columns of the matrix reflect features of a state of the machine and other columns describe valid transitions between the states of the machine depending on input characters, and compressing the payload-transition matrix in a row-displaced format.
41 Citations
19 Claims
-
1. A method of operating a storage of a finite state machine, the method comprising:
-
organizing information concerning an operation of the machine in a payload-transition matrix, in which a given number of columns of the matrix reflect features of a state of the machine and other columns describe valid transitions between the states of the machine depending on input characters; and compressing the payload-transition matrix in a row-displaced format. - View Dependent Claims (2, 3, 4, 5, 6, 9, 10, 11)
-
-
7. A method of operating a storage of a finite state machine comprising:
-
organizing information concerning an operation of the machine in a payload-transition matrix, in which a given number of columns of the matrix reflect features of a state of the machine and other columns describe valid transitions between the states of the machine depending on input characters; reducing the alphabet of the machine by converting each of the valid transitions into a set of valid sub-transitions; and compressing the payload-transition matrix in a row-displaced format.
-
-
8. A method of operating a storage of a finite state machine, the method comprising:
-
where the machine includes a set of words that have been converted into data that is characterized by a set of states linked by transitions specifying permissible input characters, generating a payload-transition matrix in which a given number of columns of the matrix reflect features of a state of the machine and other columns describe valid transitions between the states of the machine depending on input characters; and compressing the payload-transition matrix in a row-displaced format. - View Dependent Claims (12)
-
-
13. A method of operating a storage of a finite state machine, the method comprising:
-
where the machine includes a set of words have been converted into data that is characterized by a set of states linked by transitions specifying permissible input characters, generating a payload-transition matrix in which a given number of columns of the matrix reflect features of a state of the machine and other columns describe valid transitions between the states of the machine depending on input characters; reducing the alphabet of the set of the words by secondarily converting each of the transitions into a set of sub-transitions; and compressing the payload-transition matrix in a row-displaced format.
-
-
14. A storage system for a finite state machine comprising:
-
a storage unit configured to store the machine including data of a set of words that have been converted into data that is characterized by a set of states linked by transitions specifying permissible input characters; and a generating unit configured to generate a payload-transition matrix, in which a given number of columns of the matrix reflect features of a state of the machine and other columns describe valid transitions between the states of the machine depending on input characters. - View Dependent Claims (15, 16, 17, 18, 19)
-
Specification