On the expected duration of a search for a fixed pattern in random data (Corresp.)
From MaRDI portal
Publication:4404776
DOI10.1109/TIT.1973.1055064zbMath0278.94008MaRDI QIDQ4404776
Publication date: 1973
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items
Avoiding cross-bifix-free binary words ⋮ Cross-bifix-free sets generation via Motzkin paths ⋮ String overlaps, pattern matching, and nontransitive games ⋮ Periods in strings ⋮ A simple suboptimal construction of cross-bifix-free codes