Some generalizations on counting binary strings

zbMATH Open1206.05010MaRDI QIDQ3581908FDOQ3581908

Joshua T. Abbott

Publication date: 2 September 2010

Recommendations

• Expected Number of Distinct Subsequences in Randomly Generated Binary Strings
• scientific article; zbMATH DE number 4774
• Counting palindromic binary strings without \(r\)-runs of ones
• scientific article
• Binary strings and the Jacobsthal numbers

zbMATH Keywords

Jacobsthal numbersbinary stringssymbol codes

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Cited In (7)

• On the Varshamov-Tenengolts construction on binary strings
• Counting certain binary strings
• Title not available (Why is that?)
• On a Conjecture about Binary Strings Distribution
• Counting Parameterized Border Arrays for a Binary Alphabet
• Counting Dependent and Independent Strings
• Sequences of binary strings with relation of conditional simplicity

This page was built for publication: Some generalizations on counting binary strings

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