Topological automata

Authors:
Emmanuel Jeandel
Affiliations:
LIP (UMR CNRS, ENS Lyon, INRIA, Univ. Claude Bernard Lyon 1), École Normale Supérieure de Lyon, LYON cedex 07, France
Venue:
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Year:
2005

Citing 5
Cited 0

On the Power of Finite Automata with both Nondeterministic and Probabilistic States

SIAM Journal on Computing
Quantum automata and quantum grammars

Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
On the Lower Bounds for One-Way Quantum Automata

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
On the power of quantum finite state automata

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.