Bit strings without q-separation

DOI10.1007/BF01952780zbMATH Open0714.68057MaRDI QIDQ751302FDOQ751302

Authors: John Konvalina, Yi-Hsin Liu 

Publication date: 1991

Published in: BIT (Search for Journal in Brave)

Recommendations

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

zbMATH Keywords

recurrence relationFibonacci numbersbit stringscombinatorial enumeration

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Subsets without \(q\)-separation and binomial products of Fibonacci numbers

Cited In (1)

• Title not available (Why is that?)

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)