论文标题
等待时间的重复算法，以$ k $的长度$ k $与广义斐波那契序列有关
Recurrence algorithms of waiting time for the success run of length $k$ in relation to generalized Fibonacci sequences
论文作者
论文摘要
令$ v（k）$表示等待时间，即连续获得$ k $的试验次数。我们提出了使用$ k $ $ k $的概率和马尔努夫依赖性的Bernoulli试验序列中的概率分布函数（PDF）的复发算法（PDF）和$ V（k）$的概率生成函数（PGF）。在两种情况下，都列出了概率分布的最大似然估计方法（MLE）方法。
Let $V(k)$ denote the waiting time, the number of trials needed to get a consecutive $k$ ones. We propose recurrence algorithms for the probability distribution function (pdf) and the probability generating function (pgf) of $V(k)$ in sequences of independent and Markov dependent Bernoulli trials using generalized Fibonacci sequences of order $k$. Maximum likelihood estimation (MLE) methods for the probability distributions are presented in both cases with simulation examples.
