1. A method for computing a minimum-length strip-rule access control list for a given input strip-rule pattern, the method comprising the steps of: computing a minimum cost series of states to generate the input strip-rule pattern using a shortest-path algorithm, the algorithm repeatedly calculating successor states of a given state, and their costs, and discarding more expensive duplicate states if discovered; and determining the minimum-length strip-rule access control list from the series of states.