Random Generation of Combinatorial Structures using Context-Fee Grammars

DOI10.1016/S1571-0653(04)00551-7MaRDI QIDQ3439054zbMATH OpenFDO

Authors Sukhamay Kundu

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S1571-0653(04)00551-7

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Grammars and rewriting systems (68Q42) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Random context structure grammars and automata - a formal approach
• scientific article; zbMATH DE number 3921975
• Random Generation for Finitely Ambiguous Context-free Languages
• A hierarchy of random-context grammars and automata
• scientific article; zbMATH DE number 637483
• Context-free grammars, generating functions and combinatorial arrays
• Non-redundant random generation algorithms for weighted context-free grammars
• Some combinatorial arrays generated by context-free grammars
• scientific article; zbMATH DE number 1375603
• The generative power of probabilistic and weighted context-free grammars

Cited in

(7)

• Compositional generation of home states in free choice nets
• A heuristic method for generating large random expressions
• Generating all permutations by context-free grammars in Chomsky normal form
• Random context structure grammars and automata - a formal approach
• Random Generation for Finitely Ambiguous Context-free Languages
• scientific article; zbMATH DE number 3921975 (Why is no real title available?)
• scientific article; zbMATH DE number 4024825 (Why is no real title available?)

This page was built for publication: Random Generation of Combinatorial Structures using Context-Fee Grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439054)