Efficient oracles for generating binary bubble languages

MaRDI QIDQ426808zbMATH OpenFDO

Authors Joe Sawada, A. Williams

Publication date 12 June 2012

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i1p42

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Lyndon wordnecklaceGray codeknapsackbubble languageCAT algorithmcool-lexreversible stringsunit interval graph

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05) Algorithms on strings (68W32)

Recommendations

• Binary bubble languages and cool-lex order
• Ranking and loopless generation of \(k\)-ary Dyck words in cool-lex order
• Cool-lex order and \(k\)-ary Catalan structures
• Exhaustive generation of combinatorial objects by ECO
• The coolest way to generate combinations

Cited in

(10)

• A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
• Cool-lex order and \(k\)-ary Catalan structures
• Successor rules for flipping pancakes and burnt pancakes
• Traversing combinatorial 0/1-polytopes via optimization
• The coolest way to generate binary strings
• Bubble-flip -- a new generation algorithm for prefix normal words
• Combinatorial generation via permutation languages. I: Fundamentals
• On infinite prefix normal words
• Binary bubble languages and cool-lex order
• Generating a Gray code for prefix normal words in amortized polylogarithmic time per word

Describes a project that uses

Uses Software

• Knapsack
• OEIS

This page was built for publication: Efficient oracles for generating binary bubble languages

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