Characterizations of quantum automata
Theoretical Computer Science
Automata theory based on quantum logic: some characterizations
Information and Computation
A probabilistic model of computing with words
Journal of Computer and System Sciences
Quantum versus deterministic counter automata
Theoretical Computer Science
Small size quantum automata recognizing some regular languages
Theoretical Computer Science - The art of theory
Some formal tools for analyzing quantum automata
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Determination of equivalence between quantum sequential machines
Theoretical Computer Science
Automata theory based on quantum logic: Reversibilities and pushdown automata
Theoretical Computer Science
Quantum automata for some multiperiodic languages
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
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
Some algebraic properties of measure-once two-way quantum finite automata
Quantum Information Processing
An application of quantum finite automata to interactive proof systems
Journal of Computer and System Sciences
On a class of languages recognizable by probabilistic reversible decide-and-halt automata
Theoretical Computer Science
Efficient probability amplification in two-way quantum finite 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
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
Multi-letter reversible and quantum finite automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Trace monoids with idempotent generators and measure-only quantum automata
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
Behaviours of Unary Quantum Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Unbounded-error quantum computation with small space bounds
Information and Computation
Languages recognized by nondeterministic quantum finite automata
Quantum Information & Computation
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
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
Journal of Computer and System Sciences
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
One-Way reversible and quantum finite automata with advice
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Parallel quantum algorithm for finding the consistency of saaty's matrices
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
On the complexity of minimizing probabilistic and quantum automata
Information and Computation
State succinctness of two-way finite automata with quantum and classical states
Theoretical Computer Science
Hi-index | 0.01 |
The 2-way quantum finite automaton introduced by Kondacs and Watrous [Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997, IEEE Computer Society, pp. 66--75] can accept nonregular languages with bounded error in polynomial time. If we restrict the head of the automaton to moving classically and to moving only in one direction, the acceptance power of this 1-way quantum finite automaton is reduced to a proper subset of the regular languages.In this paper we study two different models of 1-way quantum finite automata. The first model, termed measure-once quantum finite automata, was introduced by Moore and Crutchfield [ Theoret. Comput. Sci., 237 (2000), pp. 275--306], and the second model, termed measure-many quantum finite automata, was introduced by Kondacs and Watrous [Proceedings of the38th Annual Symposium on Foundations of Computer Science, 1997, IEEE Computer Society, pp. 66--75].We characterize the measure-once model when it is restricted to accepting with bounded error and show that, without that restriction, it can solve the word problem over the free group. We also show that it can be simulated by a probabilistic finite automaton and describe an algorithm that determines if two measure-once automata are equivalent.We prove several closure properties of the classes of languages accepted by measure-many automata, including inverse homomorphisms, and provide a new necessary condition for a language to be accepted by the measure-many model with bounded error. Finally, we show that piecewise testable sets can be accepted with bounded error by a measure-many quantum finite automaton, introducing new construction techniques for quantum automata in the process.