Skip to main content
SpringerLink
Log in

Topological Automata

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

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

    Emmanuel Jeandel

Authors
  1. Emmanuel Jeandel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Emmanuel Jeandel.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jeandel, E. Topological Automata. Theory Comput Syst 40, 397–407 (2007). https://doi.org/10.1007/s00224-006-1314-y

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-006-1314-y

Keywords

Search

Navigation