scientific article; zbMATH DE number 2040940

zbMath1038.68566MaRDI QIDQ4452089

No author found.

Publication date: 11 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2731/27310073.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Combinatorics on words (68R15) Prefix, length-variable, comma-free codes (94A45)

Related Items

Inside the binary reflected gray code: flip-swap languages in 2-gray code order ⋮ A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words ⋮ Gray code for permutations with a fixed number of cycles ⋮ Generalized algorithm for restricted weak composition generation ⋮ Flip-swap languages in binary reflected Gray code order ⋮ Restricted compositions and permutations: from old to new Gray codes ⋮ Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions ⋮ Gray coding cubic planar maps ⋮ Binary bubble languages and cool-lex order ⋮ Efficient generation of restricted growth words ⋮ Prefix partitioned Gray codes for particular cross-bifix-free sets ⋮ More restrictive Gray codes for necklaces and Lyndon words ⋮ Gray codes for signed involutions ⋮ A general exhaustive generation algorithm for Gray structures ⋮ Gray code orders for \(q\)-ary words avoiding a given factor ⋮ The coolest way to generate combinations ⋮ Strings from linear recurrences and permutations: a gray code ⋮ Minimal change list for Lucas strings and some graph theoretic consequences