Object grammars and bijections

Authors:
I. Dutour;J. M. Fédou
Affiliations:
LaBRI, Université Bordeaux I, Unité associée au CNRS UMR 5800, 351 cours de la Libération, 33405 Talence Cedex, France;I3S-ESSI, Université de Nice, Unité associée au CNRS UPRES -A 6070, 650 Route des Colles, B.P. 145, 06903 Sophia-Antipolis Cedex, France
Venue:
Theoretical Computer Science
Year:
2003

Citing 4
Cited 2

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
A Transformation System for Developing Recursive Programs

Journal of the ACM (JACM)
Enumerative combinatorics and algebraic languages

FCT '85 Fundamentals of Computation Theory

From object grammars to ECO systems

Theoretical Computer Science
Enumeration of 4-stack polyominoes

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

A new systematic approach for the specification 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 confirms once more the key role of Dyck words in the domain of enumerative and bijective combinatorics.