  We construct a hierarchy of regular languages such that the current language
in the hierarchy can be accepted by 1-way quantum finite automata with a
probability smaller than the corresponding probability for the preceding
language in the hierarchy. These probabilities converge to 1/2.
