In discrete time, $\ell$-blocks of red lights are separated by $\ell$-blocks of green lights. Cars arrive at random. \ We seek the distribution of maximum line length of idle cars, and justify conjectured probabilistic asymptotics algebraically for $2\leq\ell\leq3$ and numerically for $\ell\geq4$.

中文翻译：

---

交通灯、结块和 QBD

在离散时间，$\ell$-块红灯被$\ell$-块绿灯隔开。汽车随机到达。\ 我们寻求闲置汽车的最大线路长度的分布，并在代数上为 $2\leq\ell\leq3$ 和在数值上为 $\ell\geq4$ 证明推测的概率渐近性是正确的。