Counting cyclic binary strings

DOI10.1080/0025570X.2007.11953447MaRDI QIDQ3103455zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 7 December 2011

Published in Mathematics Magazine (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0025570x.2007.11953447

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Combinatorics (educational aspects) (97K20)

Recommendations

• scientific article; zbMATH DE number 3974323
• Counting -- basic and less basic
• Counting circular caterpillars
• scientific article; zbMATH DE number 2124069
• Constructive enumeration of bit strings

Cited in

(6)

• Counting certain binary strings
• A class of generalized Tribonacci sequences applied to counting problems
• scientific article; zbMATH DE number 3927976 (Why is no real title available?)
• A counting algorithm for a cyclic binary query
• Universal Cycles for Weight-Range Binary Strings
• Counting distinct strings

This page was built for publication: Counting cyclic binary strings

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