2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/94052We 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.14 pages, to appear in COCOON'99Quantum PhysicsComputational Complexitytext