The following problem has been considered in [3] and [1] : For n regular languages each of which is accepted by an n-state DFA, what is the number of states of a minimum DFA that accepts th e intersection of the n languages in the worst case? Birget in [1] tried to prove that the lower boun d for the above problem is nn . Unfortunately, his proof isâ€¦ (More)