A construction for enumerating k-coloured Motzkin paths
We illustrate a method for enumerating k- coloured Motzkin paths according to various parameters and, we give a recursive description of these paths from which we deduce the k- coloured Motzkin paths' generating function according to their length, area and last fall length.
Unable to display preview. Download preview PDF.
- 1.Barcucci, E., Del Lungo, A., Pergola, E., Pinzani, R.: Towards a methodology for tree enumeration. Proc. of the 7th FPSAC, Marne-la-Vallée, 1995 (to appear)Google Scholar
- 2.Bousquet-Mélou, M.: A method for the enumeration of various classes of column-convex polygons. Report LaBRI 378–93, Université Bordeaux I (1993).Google Scholar
- 3.Flajolet P.: Combinatorial aspects of continued fractions. Discrete Mathematics 32 (1980) 125–161.Google Scholar
- 5.Goulden, I. P., Jackson, D. M.: Combinatorial enumeration. John Wiley and Sons, New York (1983).Google Scholar