Some generalizations on counting binary strings

MaRDI QIDQ3581908zbMATHFDO

Authors Joshua T. Abbott

Publication date 2 September 2010

zbMATH Keywords

Jacobsthal numbersbinary stringssymbol codes

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

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; zbMATH DE number 5533275
• Binary strings and the Jacobsthal numbers

Cited in

(8)

• On the Varshamov-Tenengolts construction on binary strings
• Counting Dependent and Independent Strings
• Sequences of binary strings with relation of conditional simplicity
• scientific article; zbMATH DE number 3927976 (Why is no real title available?)
• On a Conjecture about Binary Strings Distribution
• Counting Parameterized Border Arrays for a Binary Alphabet
• Counting certain binary strings
• Minimizing positive integer sequences without duplicate substrings

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)