An Erdős-Révész Type Law for the Length of the Longest Match of Two Coin-Tossing Sequences
Consider a coin-tossing sequence, i.e., a sequence of independent variables, taking values 0 and 1 with probability <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>1</mn><mo>/</mo&...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-01-01
|
| Series: | Entropy |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1099-4300/27/1/34 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|