Words in Random Binary Sequences I
Abstract
When flipping a fair coin, let W = L1L2...LN with Li∈\H,T\ be a binary word of length N=2 or N=3. In this paper, we establish second- and third-order linear recurrence relations and their generating functions to discuss the probabilities pW(n) that binary words W appear for the first time after n coin tosses.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.