scientific article

From MaRDI portal

Revision as of 14:24, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2752160

Jump to:navigation, search

zbMath0982.68178MaRDI QIDQ2752160

Vicentiu Vajnovszki

Publication date: 21 October 2001

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

zbMATH Keywords

Gray code bitstrings

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (8)

A trace partitioned Gray code forq-ary generalized Fibonacci strings ⋮ Gray codes for Fibonacci \(q\)-decreasing words ⋮ Prefix partitioned Gray codes for particular cross-bifix-free sets ⋮ Loop-free Gray code algorithms for the set of compositions ⋮ Catalan words avoiding pairs of length three patterns ⋮ Gray code orders for \(q\)-ary words avoiding a given factor ⋮ Strings from linear recurrences and permutations: a gray code ⋮ Minimal change list for Lucas strings and some graph theoretic consequences

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2752160&oldid=15628364"