Consider a queueing system in which customers arrive in accordance with a renewal process having an interarrival distribution F, and in which the service times of customers are independent and have distribution G. Moreover, suppose that there are k (k ≦ ∞) servers and that an arriving customer is immediately served if he finds one of the servers free, and if not then he joins the queue.

It is often convenient to construct a branching diagram to represent the relationships between languages belonging to the same language family (for example, between Romance languages such as Rumanian, Italian, French and Spanish). It is desirable that the diagram should illustrate both the closeness of the relationships (that is, which pairs of languages have an immediate common ancestor and which are more remotely related) and the relative chronology of the languages. In this paper, the problem of estimating the time since two languages had a common ancestor and were the same is considered. Interval estimates are sought since, in general, consistent point estimates may be impossible; a numerical example is given to illustrate this.

The problem of random n-fold coincidences for Geiger counters was considered by Janossy [1] and Schrödinger [2]. In this note we consider a more general problem related to the following model.