Topological Automata

Authors:
Emmanuel Jeandel
Affiliations:
LIP, Ecole Normale Superieure de Lyon, 46 allee d'Italie, F-69364 Lyon Cedex 07, France
Venue:
Theory of Computing Systems
Year:
2007

Citing 0
Cited 4

Quantum computation with devices whose contents are never read

UC'10 Proceedings of the 9th international conference on Unconventional computation
Characterizations of one-way general quantum finite automata

Theoretical Computer Science
Quantum computation with write-only memory

Natural Computing: an international journal
Proving the Power of Postselection

Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.