Efficient Oracles for Generating Binary Bubble Languages

@article{Sawada2012EfficientOF,
  title={Efficient Oracles for Generating Binary Bubble Languages},
  author={Joe Sawada and Aaron Williams},
  journal={Electr. J. Comb.},
  year={2012},
  volume={19},
  pages={P42}
}
Given a string α = 10γ in a binary language L, the bubble lower bound is the smallest non-negative integer j such that 1s−10t−j10jγ ∈ L. We present an efficient oracle, which is a function that returns the bubble lower bound, for a number of fixed-density languages including: k-ary Dyck words, connected unit interval graphs, linear-extensions of B-posets, those lexicographically larger than ω, those avoiding 10 for fixed k, reversible strings and feasible solutions to knapsack problems. Using… CONTINUE READING
10 Citations
9 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Enumerative Combinatorics

  • R. Stanley
  • Cambridge University Press
  • 1997

Generating neckties: algorithms Gray codes and parity differences

  • T. Wang, F. Ruskey
  • 1993

Similar Papers

Loading similar papers…