We give here a new, topological, definition of automata that extends previous definitions of probabilistic and quantum automata.
We then prove in an unified framework that deterministic or non-deterministic probabilistic and quantum automata with an isolatedthreshold
recognize only regular languages.
Keywords Finite Automata - Formal Languages - ProbabilisticAutomata - Quantum Automata