Bit strings without q-separation

DOI10.1007/BF01952780MaRDI QIDQ751302zbMATH OpenFDO

Authors John Konvalina, Yi-Hsin Liu

Publication date 1991

Published in BIT (Search for Journal in Brave)

zbMATH Keywords

recurrence relationFibonacci numbersbit stringscombinatorial enumeration

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Exact enumeration problems, generating functions (05A15)

Recommendations

• Subsets without \(q\)-separation and binomial products of Fibonacci numbers
• scientific article; zbMATH DE number 166128
• Enumerating binary strings without \(r\)-runs of ones
• Constructive enumeration of bit strings
• scientific article; zbMATH DE number 3456973

Cites work

• scientific article; zbMATH DE number 3127542 (Why is no real title available?)
• Subsets without \(q\)-separation and binomial products of Fibonacci numbers

Cited in

(2)

• Constructive enumeration of bit strings
• scientific article; zbMATH DE number 2192217 (Why is no real title available?)

This page was built for publication: Bit strings without q-separation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751302)