An equivalence class of machines is identified which generate maximal length sequences as a non-overlapping series of k-bit words. This is achieved at the expense of a k-fold increase in combinational logic but with no increase in the number of storage elements required.