Efficient oracles for generating binary bubble languages
From MaRDI portal
Publication:426808
zbMath1362.68304MaRDI QIDQ426808
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
knapsackGray codeLyndon wordnecklacebubble languageCAT algorithmcool-lexreversible stringsunit interval graph
Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Algorithms on strings (68W32)
Related Items (8)
A Gray code for fixed-density necklaces and Lyndon words in constant amortized time ⋮ Successor rules for flipping pancakes and burnt pancakes ⋮ Binary bubble languages and cool-lex order ⋮ The coolest way to generate binary strings ⋮ Generating a Gray code for prefix normal words in amortized polylogarithmic time per word ⋮ On infinite prefix normal words ⋮ Bubble-flip -- a new generation algorithm for prefix normal words ⋮ Combinatorial generation via permutation languages. I. Fundamentals
Uses Software
This page was built for publication: Efficient oracles for generating binary bubble languages
