Random Generation of Combinatorial Structures using Context-Fee Grammars

DOI10.1016/S1571-0653(04)00551-7zbMATH Open1193.05153MaRDI QIDQ3439054

Sukhamay Kundu

Publication date: 29 May 2007

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

Mathematics Subject Classification ID

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

Related Items (5)

Random context structure grammars and automata - a formal approach ⋮ Compositional generation of home states in free choice nets ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Random Generation for Finitely Ambiguous Context-free Languages

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Non-redundant random generation algorithms for weighted context-free grammars 👍 👎
• A hierarchy of random-context grammars and automata 👍 👎
• Context-free grammars, generating functions and combinatorial arrays 👍 👎
• Some combinatorial arrays generated by context-free grammars 👍 👎
• Random context structure grammars and automata - a formal approach 👍 👎
• Random Generation for Finitely Ambiguous Context-free Languages 👍 👎
• The Generative Power of Probabilistic and Weighted Context-Free Grammars 👍 👎

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)