On the generating functions of pattern-avoiding Motzkin paths

Using a recursive approach, we show that the generating function for sets of Motzkin paths avoiding a single (not necessarily consecutive) pattern is rational over x and the Catalan generating function [Formula presented], where x keeps track of the length of the path. Moreover, an algorithm is provided for finding the generating function in the more general case of an arbitrary set of patterns. In addition, this algorithm allows us to find a combinatorial specification for pattern-avoiding Motzkin paths, which can be used not only for enumeration, but also for exhaustive and random generation.