Discrete Mathematics & Theoretical Computer Science · 1998 · 18 citations · 7 references
Natural SciencesComputer ScienceMathematicsAlgorithmsCombinatoricsCombinatorial EnumerationContext-free LanguagesEnumerative CombinatoricsEnumeration Of Combinatorial ClassesLanguage GenerationObjects
This paper presents a new systematic approach for the uniform random generation of combinatorial objects. The method is based on the notion of object grammars which give recursive descriptions of objects and generalize context-freegrammars. The application of particular valuations to these grammars leads to enumeration and random generation of objects according to non algebraic parameters.
7
Algebraic languages and polyominoes enumeration
M. Delest, Gérard Viennot · Theoretical Computer Science · 1984 · 328 citations
Gian‐Carlo Rota · Advances in Mathematics · 1976 · 286 citations
Edward A. Bender · Discrete Mathematics · 1974 · 40 citations