Abstract | ||
---|---|---|
In this paper, we use ECO method and the concept of succession rule to enumerate restricted classes of combinatorial objects. Let &&Ohgr; be the succession rule describing a construction of a combinatorial objects class, then the construction of the restricted class is described by means of an approximating succession rule &Ohgr;Rk obtained from &&Ohgr; in a natural way. We give sufficient conditions for the rule k to be finite; finally we determine finite approximating rules for various classes of paths, and the approximation of the corresponding algebraic language with a regular one. |
Year | DOI | Venue |
---|---|---|
2002 | 10.1016/S0304-3975(01)00085-8 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
Generating functions,various class,approximating succession rule,rule k,algebraic function,Algebraic languages,combinatorial objects class,combinatorial object,succession rule,ECO method,finite approximating rule,Approximation,restricted class,corresponding algebraic language | Journal | 270 |
Issue | ISSN | Citations |
1-2 | Theoretical Computer Science | 4 |
PageRank | References | Authors |
0.54 | 3 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
elisa pergola | 1 | 45 | 7.38 |
R. Pinzani | 2 | 90 | 15.91 |
Simone Rinaldi | 3 | 174 | 24.93 |