Combinatorics for computer science
Combinatorics for computer science
Gray code sequences of partitions
Journal of Algorithms
Generating binary trees by transpositions
Journal of Algorithms
Generation of well-formed parenthesis strings in constant worst-case time
Journal of Algorithms
An Eades-McKay algorithm for well-formed parenthesis strings
Information Processing Letters
Journal of the ACM (JACM)
A loopless gray-code algorithm for listing k-ary trees
Journal of Algorithms
Efficient generation of the binary reflected gray code and its applications
Communications of the ACM
Algorithm 452: enumerating combinations of m out of n objects [G6]
Communications of the ACM
Communications of the ACM
Combinatorial Algorithms: For Computers and Hard Calculators
Combinatorial Algorithms: For Computers and Hard Calculators
Simple Combinatorial Gray Codes Constructed by Reversing Sublists
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Minimal change list for Lucas strings and some graph theoretic consequences
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
A loop-free two-close Gray-code algorithm for listing k-ary Dyck words
Journal of Discrete Algorithms
More restrictive Gray codes for necklaces and Lyndon words
Information Processing Letters
Generating balanced parentheses and binary trees by prefix shifts
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Loop-free Gray code algorithm for the e-restricted growth functions
Information Processing Letters
Restricted compositions and permutations: From old to new Gray codes
Information Processing Letters
Binary bubble languages and cool-lex order
Journal of Combinatorial Theory Series A
Efficient generation of restricted growth words
Information Processing Letters
Hi-index | 0.00 |
We give a definition of Gray code that, unlike the standard "minimal change" definition, is satisfied by the word-lists in the literature called "Gray codes" and we give several examples to illustrate the various concepts of minimality. We show that a non-recursive generation algorithm can be obtained for a word-list such that all the words with the same prefix (or, equivalently, suffix) are consecutive and that the Bitner-Ehrlich-Reingold method of generating each word in a time bounded by a constant works under the additional condition that in the interval of words with the same prefix or suffix the next letter assumes at least two values. Finally we generalize this method so that it works under a weaker condition satisfied by almost all the Gray codes in the literature: if the next letter assumes only one value, then the interval contains only one word.