We look at various notions of MSOL definability for graph polynomials and
generating functions and show how these can be exploited algorithmically.
Typically, MSOL definability allows one to find linear recurrences for combinatorial
functions, or to exploit dynamic programming approaches.
We shall discuss the limitations of these methods and less known applications.