Random generation and approximate counting of ambiguously described combinatorial structures

DOI10.1007/3-540-46541-3_47MaRDI QIDQ4501563zbMATH OpenFDO

Authors Massimiliano Goldwurm, Massimo Santini, Alberto Bertoni

Publication date 13 June 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46541-3_47

zbMATH Keywords

combinatorial structuresfinitely ambiguous context-free languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics in computer science (68R05)

Recommendations

• Random Generation for Finitely Ambiguous Context-free Languages
• Random generation of combinatorial structures from a uniform distribution
• scientific article; zbMATH DE number 910913
• scientific article; zbMATH DE number 1688372

Cited in

(8)

• Random generation of combinatorial structures from a uniform distribution
• Random generation of combinatorial structures -- GASCom 2016. Proceedings of the 10th GASCom conference, Centre IGESA, La Marana, Corsica, France, June 1 -- June 4, 2016.
• Sublogarithmic ambiguity
• scientific article; zbMATH DE number 2127754 (Why is no real title available?)
• Generating, sampling and counting subclasses of regular tree languages
• scientific article; zbMATH DE number 910913 (Why is no real title available?)
• The weighted grammar constraint
• Preface

This page was built for publication: Random generation and approximate counting of ambiguously described combinatorial structures

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