Finite state machines have sequential, iterative network implementatio
ns. The authors show that by the proposed algorithm and Boolean matrix
operations, nonlinear parts of recurrence sequences can be eliminated
. Linear mapping is thus obtained, which by use of the prefix techniqu
e, results in parallel lookahead circuits.