๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Iterating an $\alpha$-ary Gray code

โœ Scribed by Lichtner, Jonathan

Book ID
118198125
Publisher
Society for Industrial and Applied Mathematics
Year
1998
Tongue
English
Weight
280 KB
Volume
11
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Note on Iterating an $\alpha$-ary Gray
A Note on Iterating an $\alpha$-ary Gray Code
โœ Lu, Chi-Jen; Tsai, Shi-Chun ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 94 KB
Affine m-ary gray codes
Affine m-ary gray codes
โœ Martin Cohn ๐Ÿ“‚ Article ๐Ÿ“… 1963 ๐Ÿ› Elsevier Science โš– 329 KB
On m-ary Gray codes
On m-ary Gray codes
โœ Bhu Dev Sharma; Ravinder Kumar Khann ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 727 KB
A Loopless Gray-Code Algorithm for Listi
A Loopless Gray-Code Algorithm for Listing k-ary Trees
โœ Dominique Roelants van Baronaigien ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 91 KB

The bit sequence representation for k-ary trees is a sequence b , b , . . . , b of bits that is formed by doing a preorder traversal of the k-ary tree and writing a 1 when the visited subtree is not empty and a zero when the visited subtree is empty. The representation is well known and in the cas