First Occurrence in Pairs of Long Words: A Penney-ante Conjecture of Pevzner

DOI10.1017/S0963548300001656MaRDI QIDQ4862748zbMATH OpenWikidataFDO

Authors Dudley Stark

Publication date 28 May 1996

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

pairs of long wordsrandom elements taking on values in some finite space

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Probabilistic games; gambling (91A60)

Recommendations

• First occurrence of a word among the elements of a finite dictionary in random sequences of letters
• On expected waiting time until given words appear in random sequence
• Critical phenomena in sequence matching
• A further note on runs in independent sequences
• A limit theorem for the number of non-overlapping occurrences of a pattern in a sequence of independent trials

Cites work

• A circular property of the occurrence of sequence patterns in the fair coin-tossing process
• A martingale approach to the study of occurrence of sequence patterns in repeated experiments
• Periods in strings
• Renewal theory for several patterns
• String overlaps, pattern matching, and nontransitive games

Cited in

(4)

• Long twins in random words
• First occurrence of a word among the elements of a finite dictionary in random sequences of letters
• The Lexicographic First Occurrence of a I-II-III pattern
• scientific article; zbMATH DE number 7731179 (Why is no real title available?)

This page was built for publication: First Occurrence in Pairs of Long Words: A Penney-ante Conjecture of Pevzner

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