Generating functionology
Attribute grammars are useful for combinatorics
Theoretical Computer Science - Selected papers of the 2nd workshop on algebraic and computer-theoretic aspects of formal power series
A calculus for the random generation of labelled combinatorial structures
Theoretical Computer Science
Generating trees and the Catalan and Schro¨der numbers
Discrete Mathematics
A method for the enumeration of various classes of column-convex polygons
Discrete Mathematics
Random generation of trees and other combinatorial objects
Theoretical Computer Science - Special issue on Caen '97
Generating trees and proper Riordan arrays
Discrete Mathematics
Generating functions for generating trees
Discrete Mathematics
Attribute grammars and automatic complexity analysis
Advances in Applied Mathematics - Special issue on: Formal power series and algebraic combinatorics in memory of Rodica Simion, 1955-2000
Object grammars and bijections
Theoretical Computer Science
The On-Line Encyclopedia of Integer Sequences
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Finitely labeled generating trees and restricted permutations
Journal of Symbolic Computation
| Hi-index | 5.23 |
In this paper we make a comparison between two methods for the enumeration of combinatorial objects, namely the ECO method and object grammars, both based on a recursive description for the examined class of objects. In particular, we study the problem of passing from an object grammar to an "equivalent" ECO system. First, we solve this problem for any unidimensional, unambiguous, and complete object grammar, with any linear parameter. Then we treat the more complex cases of q-linear parameters, and of multidimensional object grammars, giving some explanatory examples. In particular, we determine a new ECO system for the class of directed convex polyominoes.