A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Object grammars and bijections
2003
Theoretical Computer Science
A new systematic approach for the speciÿcation of bijections between sets of combinatorial objects is presented. It is based on the notion of object grammars. Object grammars give recursive descriptions of objects and generalize context-free grammars. The study of a particular substitution in these object grammars conÿrms once more the key role of Dyck words in the domain of enumerative and bijective combinatorics. (I. Dutour), fedou@unice.fr (J.M. FÃ edou). 0304-3975/02/$ -see front matter c
doi:10.1016/s0304-3975(02)00368-7
fatcat:6qg4ettdqncener5g3v2cmfl2u