Various Aspects of Finite Quantum Automata

Authors:
Mika Hirvensalo
Affiliations:
Department of Mathematics, University of Turku, Turku, Finland FI-20014 and TUCS --- Turku Centre for Computer Science, and Supported by Turku University Foundation,
Venue:
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Year:
2008

Citing 18
Cited 6

Natural proofs

Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Quantum Complexity Theory

SIAM Journal on Computing
Quantum automata and quantum grammars

Theoretical Computer Science
Automata, Languages, and Machines

Automata, Languages, and Machines
Characterizations of 1-Way Quantum Finite Automata

SIAM Journal on Computing
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 Class of Languages Recognizable by 1-Way Quantum Finite Automata

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Exact results for accepting probabilities of quantum automata

Theoretical Computer Science - 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
1-way quantum finite automata: strengths, weaknesses and generalizations

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Quantum Computing (Natural Computing Series)

Quantum Computing (Natural Computing Series)
Decision problems for semi-Thue systems with a few rules

Theoretical Computer Science - Insightful theory
Decidable and Undecidable Problems about Quantum Automata

SIAM Journal on Computing
Introduction to probabilistic automata (Computer science and applied mathematics)

Introduction to probabilistic automata (Computer science and applied mathematics)
Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Probabilities to accept languages by quantum finite automata

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Non-constructive methods for finite probabilistic automata

DLT'07 Proceedings of the 11th international conference on Developments in language theory

Unbounded-error quantum computation with small space bounds

Information and Computation
Languages recognized by nondeterministic quantum finite automata

Quantum Information & Computation
Quantum computation with write-only memory

Natural Computing: an international journal
Another approach to the equivalence of measure-many one-way quantum finite automata and its application

Journal of Computer and System Sciences
On probabilistic and quantum reaction systems

Theoretical Computer Science
Quantum automata theory – a review

Algebraic Foundations in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Determining the birth date of computer science is a very complicated task and certainly reliant to the standpoint chosen. Some may point out the work of Kurt Gödel [18], Alan Turing [31], and Alonso Church [11], thus locating the appearance of computer science to 1930's. Some want to mention Charles Babbage's engines, some Gottfried Leibniz' Calculus Ratiocinator, and some refer back to the Euclidean algorithm.