Object grammars and bijections.
From MaRDI portal
Publication:1401204
DOI10.1016/S0304-3975(02)00368-7zbMath1044.68075OpenAlexW1974935642MaRDI QIDQ1401204
Isabelle Dutour, Jean-Marc Fedou
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00368-7
Related Items (3)
From object grammars to ECO systems ⋮ Enumeration of 4-stack polyominoes ⋮ A relation between Schröder paths and Motzkin paths
Cites Work
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- Une théorie combinatoire des séries formelles
- Attribute grammars are useful for combinatorics
- A calculus for the random generation of labelled combinatorial structures
- Algebraic languages and polyominoes enumeration
- Une bijection entre les polyominos convexes dirigés et les mots de Dyck bilatères
- A Transformation System for Developing Recursive Programs
- Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables
- ECO:a methodology for the enumeration of combinatorial objects
- Algebraic automata and context-free sets
- Automata in general algebras
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Object grammars and bijections.
