Gray codes for reflectable languages

Authors:
Yue Li;Joe Sawada
Affiliations:
Computing and Information Science, University of Guelph, Canada;Computing and Information Science, University of Guelph, Canada
Venue:
Information Processing Letters
Year:
2009

Citing 7
Cited 2

Combinatorics for computer science

Combinatorics for computer science
A Survey of Combinatorial Gray Codes

SIAM Review
On the loopless generation of binary tree sequences

Information Processing Letters
Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

Journal of the ACM (JACM)
A loopless gray-code algorithm for listing k-ary trees

Journal of Algorithms
A fast algorithm to generate open meandric systems and meanders

ACM Transactions on Algorithms (TALG)
A loopless gray code for minimal signed-binary representations

ESA'05 Proceedings of the 13th annual European conference on Algorithms

Binary bubble languages and cool-lex order

Journal of Combinatorial Theory Series A
Efficient generation of gray codes for reflectable languages

ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part IV

Quantified Score

Hi-index	0.89

Visualization

Abstract

We classify a type of language called a reflectable language. We then develop a generic algorithm that can be used to list all strings of length n for any reflectable language in Gray code order. The algorithm generalizes Gray code algorithms developed independently for k-ary strings, restricted growth strings, and k-ary trees, as each of these objects can be represented by a reflectable language. Finally, we apply the algorithm to open meandric systems which can also be represented by a reflectable language.