Pages that link to "Item:Q645969"
From MaRDI portal
The following pages link to Binary bubble languages and cool-lex order (Q645969):
Displaying 17 items.
- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time (Q391391) (← links)
- The coolest way to generate binary strings (Q489746) (← links)
- A universal cycle for strings with fixed-content (which are also known as multiset permutations) (Q832908) (← links)
- Successor rules for flipping pancakes and burnt pancakes (Q897860) (← links)
- Cool-lex order and \(k\)-ary Catalan structures (Q1932373) (← links)
- Generating a Gray code for prefix normal words in amortized polylogarithmic time per word (Q2006779) (← links)
- Generating 2-Gray codes for ballot sequences in constant amortized time (Q2092396) (← links)
- Inside the binary reflected gray code: flip-swap languages in 2-gray code order (Q2140470) (← links)
- A shift Gray code for fixed-content Łukasiewicz words (Q2169973) (← links)
- Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles (Q2635088) (← links)
- Flip-swap languages in binary reflected Gray code order (Q2676472) (← links)
- Properties of the cycles that contain all vectors of weight \(\le k\) (Q2678985) (← links)
- De Bruijn Sequences for the Binary Strings with Maximum Density (Q3078396) (← links)
- Combinatorial generation via permutation languages. I. Fundamentals (Q5863047) (← links)
- Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions (Q6052708) (← links)
- Constructing the first (and coolest) fixed-content universal cycle (Q6103527) (← links)
- Combinatorial Generation via Permutation Languages. V. Acyclic Orientations (Q6170445) (← links)