Enumerating binary strings without r-runs of ones

zbMATH Open1276.11023MaRDI QIDQ3167231FDOQ3167231

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

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

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)

Cited In (15)

• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the distribution of runs of ones in binary strings
• Binary strings without zigzags
• Bit strings without q-separation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Restricted binary strings and generalized Fibonacci numbers
• Counting palindromic binary strings without \(r\)-runs of ones

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)