Theory of Computing Systems

, Volume 40, Issue 4, pp 397–407 | Cite as

Topological Automata

  • Emmanuel JeandelEmail author


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.


Topological Space Regular Language Automaton Theory Recurrence Sequence Deterministic Automaton 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2007

Authors and Affiliations

  1. 1.LIP, Ecole Normale Superieure de Lyon, 46 allee d'ItalieF-69364 Lyon Cedex 07France

Personalised recommendations