Enumerating binary strings without r-runs of ones

MaRDI QIDQ3167231zbMATH OpenFDO

Authors Michael A. Nyblom

Publication date 2 November 2012

Full work available at URL http://www.m-hikari.com/imf/imf-2012/37-40-2012/index.html

zbMATH Keywords

binary strings\(r\)-Fibonacci sequence\(r\)-runs of ones

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Recommendations

• Counting palindromic binary strings without r-runs of ones
• Binary strings with all runs of odd length
• Binary strings of length \(n\) with \(x\) zeros and longest \(k\)-runs of zeros
• scientific article; zbMATH DE number 2192217
• Restricted binary strings and generalized Fibonacci numbers

Cited in

(15)

• Counting palindromic binary strings without r-runs of ones
• A Difference Equation for Strings of Ones
• Exponents of primitive companion matrices
• Binary strings of length \(n\) with \(x\) zeros and longest \(k\)-runs of zeros
• Constructive enumeration of bit strings
• scientific article; zbMATH DE number 140097 (Why is no real title available?)
• scientific article; zbMATH DE number 5844318 (Why is no real title available?)
• On the distribution of runs of ones in binary strings
• scientific article; zbMATH DE number 2077660 (Why is no real title available?)
• scientific article; zbMATH DE number 2192217 (Why is no real title available?)
• Binary strings without zigzags
• Bit strings without q-separation
• scientific article; zbMATH DE number 166128 (Why is no real title available?)
• scientific article; zbMATH DE number 4168688 (Why is no real title available?)
• Restricted binary strings and generalized Fibonacci numbers

This page was built for publication: Enumerating binary strings without \(r\)-runs of ones

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