A set of well-defined operations on succession rules

Abstract

In this paper we introduce a system of well-defined operations on the set of succession rules. These operations allow us to tackle combinatorial enumeration problems simply by using succession rules instead of generating functions. Finally we suggest several open problems the solation of which should lead to an algebraic characterization of the set of succession rules.