SPEAKER: Daniel Page
TITLE: Generalized Methods for Restricted Weak Composition Enumeration

ABSTRACT:
Over the past decade, researchers have been trying to seek more generalized 
algorithms for generating mathematical objects such as finite formal languages, 
and combinatorial objects.  In this talk I will present a new algorithm that 
arrives at a generalized solution for the enumeration (generation) of 
restricted weak compositions of n-parts. In particular, this generalized 
algorithm covers many commonly sought compositions such as bounded compositions,
restricted compositions, weak compositions, and restricted part compositions. 
This algorithm is for enumerating generalized types of restricted weak 
compositions called First-Order, and Second-Order Restricted Weak Compositions. 
I will also be discussing current developments in the field of Enumeration of 
Compositions in relation to Theory of Computation.

Related Topics: Computational Number Theory, Automata Theory, Combinatorics, 
Algorithms, Enumeration