We give a new, topological definition of automata that extends previous definitions of probabilistic and quantum automata. We then are able to prove in a unified framework that deterministic or non-deterministic probabilistic and quantum automata recognise only regular languages with an isolated threshold.
KeywordsTopological Space Regular Language Automaton Theory Recurrence Sequence Deterministic Automaton
Unable to display preview. Download preview PDF.