From object grammars to ECO systems
From MaRDI portal
Publication:1884915
DOI10.1016/j.tcs.2003.10.037zbMath1070.68056OpenAlexW2063055373MaRDI QIDQ1884915
Jean-Marc Fedou, Enrica Duchi, Simone Rinaldi
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2003.10.037
Combinatorics in computer science (68R05) Grammars and rewriting systems (68Q42) Polyominoes (05B50)
Related Items
Regular simple queues of protein contact maps, Lattice paths with catastrophes, Finitely labeled generating trees and restricted permutations, On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia
Uses Software
Cites Work
- Attribute grammars are useful for combinatorics
- The number of Baxter permutations
- Random generation of trees and other combinatorial objects
- A calculus for the random generation of labelled combinatorial structures
- Generating functions for generating trees
- Attribute grammars and automatic complexity analysis
- Object grammars and bijections.
- Jumping succession rules and their generating functions
- Linear recurrences with constant coefficients: The multivariate case
- Production matrices
- Exhaustive generation of combinatorial objects by ECO
- Generating trees and the Catalan and Schröder numbers
- A method for the enumeration of various classes of column-convex polygons
- Generating trees and proper Riordan arrays
- ECO:a methodology for the enumeration of combinatorial objects
- Semantics of context-free languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
