Enumeration of binary strings and applications to compositions and partitions

Abstract

In this dissertation we first introduce binary strings and give a historical back­ground. Then we discus some techniques for enumerating restricted sets of binary strings ,with several example . We employ mainly the symbolic method and recursive techniques, among others, to obtain our results. A chapter is devoted to a discus­sion of some published case studies on bit string enumerations which are relevant to our project. Then we consider how the study of binary string may facilitate the enumeration of selected classes of compositions and integer partitions.