Computer Science Journal of Moldova (Apr 2013)
ECO-generation for some restricted classes of compositions
Abstract
We study several restricted classes of compositions by giving one-to-one maps between them and different classes of restricted binary strings or pattern avoiding permutations. Inspired by the ECO method \cite{BDPP99}, new succession rules for these classes are presented. Finally, we obtain generating algorithms in Constant Amortized Time (CAT) for theses classes.