The purpose of this paper is to present a method for treating uniformly a large number of enumeration problems involving sequences over a finite alphabet subject to general restrictions. Many of these problems are classical in origin, including the Mrnage problem (Lucas [16]), the alternating permutation problem (Netto [19], Andr6 [1, 2]), the derangement problem (Montmort [18]), and more recen...