[The procedure described by Hashiguchi] leads to computations that are by far impossible, even for very small examples. For instance, if L is accepted by a 4 state automaton of loop complexity 3 , then a very low minorant of the number of languages to be tested with L for equality is: (en)
