Undecidability on quantum finite automata
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Dense quantum coding and a lower bound for 1-way quantum automata
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
How to simulate free will in a computational device
ACM Computing Surveys (CSUR)
On quantum and probabilistic communication: Las Vegas and one-way protocols
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Dense quantum coding and quantum finite automata
Journal of the ACM (JACM)
Two-way finite automata with quantum and classical states
Theoretical Computer Science - Natural computing
One-way probabilistic reversible and quantum one-counter automata
Theoretical Computer Science
On the Lower Bounds for One-Way Quantum Automata
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Exact Results for Accepting Probabilities of Quantum Automata
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Quantum and Stochastic Branching Programs of Bounded Width
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Upper Bounds on the Size of One-Way Quantum Finite Automata
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
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
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
One-Way Probabilistic Reversible and Quantum One-Counter Automata
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Quantum versus Deterministic Counter Automata
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Models of Computation, Riemann Hypothesis, and Classical Mathematics
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Quantum Finite Multitape Automata
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Quantum Finite One-Counter Automata
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Quantum versus Probabilistic One-Way Finite Automata with Counter
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Quantum Finite State Transducers
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
The Complexity of Probabilistic versus Quantum Finite Automata
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Exploiting the Difference in Probability Calculation between Quantum and Probabilistic Computations
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Automata: From Uncertainty to Quantum
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Quantum Reversibility and a New Model of Quantum Automaton
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Ambainis-Freivalds' Algorithm for Measure-Once Automata
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On Computational Power of Quantum Branching Programs
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Probabilistic Reversible Automata and Quantum Automata
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Exact results for accepting probabilities of quantum automata
Theoretical Computer Science - Mathematical foundations of computer science
Optimal Lower Bounds for Quantum Automata and Random Access Codes
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Characterizations of quantum automata
Theoretical Computer Science
Automata theory based on quantum logic: some characterizations
Information and Computation
Quantum branching programs and space-bounded nonuniform quantum complexity
Theoretical Computer Science
Quantum versus deterministic counter automata
Theoretical Computer Science
A theory of computation based on quantum logic (I)
Theoretical Computer Science
On the computational power of probabilistic and quantum branching program
Information and Computation
Determination of equivalence between quantum sequential machines
Theoretical Computer Science
Complementing two-way finite automata
Information and Computation
Automata theory based on quantum logic: Reversibilities and pushdown automata
Theoretical Computer Science
Quantum inductive inference by finite automata
Theoretical Computer Science
Theoretical Computer Science
Determining the equivalence for one-way quantum finite automata
Theoretical Computer Science
Size of Quantum Finite State Transducers
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Lower Bounds for Generalized Quantum Finite Automata
Language and Automata Theory and Applications
Some Observations on Two-Way Finite Automata with Quantum and Classical States
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues
Various Aspects of Finite Quantum Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Theoretical Computer Science
Some algebraic properties of measure-once two-way quantum finite automata
Quantum Information Processing
Improved Constructions of Quantum Automata
Theory of Quantum Computation, Communication, and Cryptography
Probabilistic Acceptors for Languages over Infinite Words
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
An application of quantum finite automata to interactive proof systems
Journal of Computer and System Sciences
Improved constructions of quantum automata
Theoretical Computer Science
On a class of languages recognizable by probabilistic reversible decide-and-halt automata
Theoretical Computer Science
Improved constructions of mixed state quantum automata
Theoretical Computer Science
Efficient probability amplification in two-way quantum finite automata
Theoretical Computer Science
Mathematical logic and quantum finite state automata
Theoretical Computer Science
Note: A note on quantum sequential machines
Theoretical Computer Science
Hierarchy and equivalence of multi-letter quantum finite automata
Theoretical Computer Science
The Effect of Tossing Coins in Omega-Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Languages Recognized with Unbounded Error by Quantum Finite Automata
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Quantum finite automata and weighted automata
Journal of Automata, Languages and Combinatorics
Theory of one-tape linear-time Turing machines
Theoretical Computer Science
On the computational power of probabilistic and quantum branching program
Information and Computation
Quantum automata and algebraic groups
Journal of Symbolic Computation
Quantum computing: 1-way quantum automata
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Probabilities to accept languages by quantum finite automata
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Multi-letter reversible and quantum finite automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Non-constructive methods for finite probabilistic automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Artin's conjecture and size of finite probabilistic automata
Pillars of computer science
Trace monoids with idempotent generators and measure-only quantum automata
Natural Computing: an international journal
Computation in Sofic Quantum Dynamical Systems
Natural Computing: an international journal
Revisiting the power and equivalence of one-way quantum finite automata
ICIC'10 Proceedings of the Advanced intelligent computing theories and applications, and 6th international conference on Intelligent computing
Postselection finite quantum automata
UC'10 Proceedings of the 9th international conference on Unconventional computation
Quantum computation with devices whose contents are never read
UC'10 Proceedings of the 9th international conference on Unconventional computation
Behaviours of Unary Quantum Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
An Algebra of Automata That Includes Both Classical and Quantum Entities
Electronic Notes in Theoretical Computer Science (ENTCS)
Unbounded-error quantum computation with small space bounds
Information and Computation
Languages recognized by nondeterministic quantum finite automata
Quantum Information & Computation
State complexity of operations on two-way deterministic finite automata over a unary alphabet
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Quantum finite automata and probabilistic reversible automata: R-trivial idempotent languages
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Characterizations of one-way general quantum finite automata
Theoretical Computer Science
Quantum finite automata and logics
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Varieties generated by certain models of reversible finite automata
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Complexity of quantum uniform and nonuniform automata
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Complementing two-way finite automata
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Superiority of exact quantum automata for promise problems
Information Processing Letters
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Exact Quantum Algorithms for the Leader Election Problem
ACM Transactions on Computation Theory (TOCT)
An application of quantum finite automata to interactive proof systems (extended abstract)
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Quantum computation with write-only memory
Natural Computing: an international journal
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
Languages recognizable by quantum finite automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
A theory of computation based on unsharp quantum logic: Finite state automata and pushdown automata
Theoretical Computer Science
Time complexity of tape reduction for reversible turing machines
RC'11 Proceedings of the Third international conference on Reversible Computation
One-Way reversible and quantum finite automata with advice
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
State complexity of operations on two-way finite automata over a unary alphabet
Theoretical Computer Science
On the complexity of minimizing probabilistic and quantum automata
Information and Computation
Hamming, permutations and automata
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Computation in sofic quantum dynamical systems
UC'07 Proceedings of the 6th international conference on Unconventional Computation
State succinctness of two-way finite automata with quantum and classical states
Theoretical Computer Science
Proving the Power of Postselection
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
Hi-index | 0.02 |
In this paper, we introduce 1-way and 2-way quantum finite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeterministic and probabilistic 1-way and 2-way finite state automata. We prove the following facts regarding 2qfa's. 1. For any /spl epsiv/0, there is a 2qfa M which recognizes the non-regular language L={a/sup m/b/sup m/|m/spl ges/1} with (one-sided) error bounded by E, and which halts in linear time. Specifically, M accepts any string in L with probability 1 and rejects any string not in L with probability at least 1-/spl epsiv/. 2. For every regular language L, there is a reversible (and hence quantum) 2-way finite state automaton which recognizes L and which runs in linear time. In fact, it is possible to define 2qfar's which recognize the non-context-free language {a/sup m/b/sup m/c/sup m/|m/spl ges/1}, based on the same technique used for 1. Consequently, the class of languages recognized by linear time, bounded error 2qfa's properly includes the regular languages. Since it is known that 2-way deterministic, nondeterministic and polynomial expected time, bounded error probabilistic finite automata can recognize only regular languages, it follows that 2qfa's are strictly more powerful than these "classical" models. In the case of 1-way automata, the situation is reversed. We prove that the class of languages recognizable by bounded error 1qfa's is properly contained in the class of regular languages.