Computing the pattern waiting time: a revisit of the intuitive approach

DOI10.4230/LIPICS.ISAAC.2016.39MaRDI QIDQ4636522zbMATH OpenOpenAlexFDO

Authors Kai Jin

Publication date 19 April 2018

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2016/6809/pdf/LIPIcs-ISAAC-2016-39.pdf/

zbMATH Keywords

Markov chainpattern occurrencePenney's gamewaiting time

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Waiting time distribution of generalized later patterns
• Waiting times and stopping probabilities for patterns in Markov chains
• THE MEAN WAITING TIME FOR A PATTERN
• On waiting time distributions for patterns in a sequence of multistate trials
• Exact and asymptotic results for pattern waiting times

Cited in

(4)

• Waiting time and complexity for matching patterns with automata
• Waiting time problems for a two-dimensional pattern
• Waiting for a Bat to Fly By (in Polynomial Time)
• THE MEAN WAITING TIME FOR A PATTERN

This page was built for publication: Computing the pattern waiting time: a revisit of the intuitive approach

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