Automata: From Uncertainty to Quantum

Authors:
Cristian Calude;Elena Calude
Affiliations:
-;-
Venue:
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Year:
2001

Citing 13
Cited 0

Computation and automata

Computation and automata
Dynamical recognizers: real time language recognition by analog computers

Theoretical Computer Science
On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine

Journal of the ACM (JACM)
Connectivity and Reversibility in Automata

Journal of the ACM (JACM)
Finite nondeterministic automata: simulation and minimality

Theoretical Computer Science
Computational complementarity for probabilistic automata

Where mathematics, computer science, linguistics and biology meet
Quantum automata and quantum grammars

Theoretical Computer Science
Shadows of the Mind: A Search for the Missing Science of Consciousness

Shadows of the Mind: A Search for the Missing Science of Consciousness
Automata and Computability

Automata and Computability
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Quantum Reversibility and a New Model of Quantum Automaton

FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On the power of quantum finite state automata

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
1-way quantum finite automata: strengths, weaknesses and generalizations

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

Automata are simple mathematical objects with unexpected computational, mathematical, modelling and explanatory capabilities. This paper examines some relations between automata and physics. Automata will be used to model quantum uncertainty and quantum computation. Finally, mathematical proofs will be discussed from the perspective of quantum automata.