The enumeration of sequences with respect to structures on a bipartition

https://doi.org/10.1016/0012-365X(80)90115-6Get rights and content
Under an Elsevier user license
open archive

Abstract

We give a method for enumerating sequences over a finite alphabet with respect to certain maximal configurations. The required generating functions are obtained as solutions of systems of linear equations. The method utilizes a combinatorial decomposition of sequences into maximal sub-configurations.

Cited by (0)