Pages that link to "Item:Q3212086"
From MaRDI portal
The following pages link to The Occurrence of Sequence Patterns in Repeated Dependent Experiments (Q3212086):
Displaying 12 items.
- A martingale approach to scan statistics (Q816583) (← links)
- String matching and 1d lattice gases (Q878347) (← links)
- On occurrence of subpattern and method of gambling teams (Q1039834) (← links)
- How long does it take to see a flat Brownian path on the average? (Q1210124) (← links)
- Explicit distributional results in pattern formation (Q1370998) (← links)
- Sooner and later waiting time problems for success and failure runs in higher order Markov dependent trials (Q1373264) (← links)
- Waiting times and stopping probabilities for patterns in Markov chains (Q1747367) (← links)
- Improved compound Poisson approximation for the number of occurrences of any rare word family in a stationary markov chain (Q3435393) (← links)
- The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach (Q4819503) (← links)
- Stopping Probabilities for Patterns in Markov Chains (Q5416558) (← links)
- Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata (Q5459921) (← links)
- Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains (Q5488994) (← links)
