SIAM Journal on Computing
Undecidability on quantum finite automata
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Regular languages accepted by quantum automata
Information and Computation
Quantum automata and quantum grammars
Theoretical Computer Science
Direct and dual laws for automata with multiplicities
Theoretical Computer Science
Quantum computation and quantum information
Quantum computation and quantum information
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Characterizations of 1-Way Quantum Finite Automata
SIAM Journal on Computing
Two-way finite automata with quantum and classical states
Theoretical Computer Science - Natural computing
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
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
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
Quantum computing: 1-way quantum automata
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Unbounded-error one-way classical and quantum communication complexity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
Quantum finite automata (QFA) can be divided into four kinds depend upon the head-directions and the measure times. They are measure-once one way QFA (MO-1QFA) introduced by Moore and Crutchfield (Theor Comput Sci 237: 275---306, 2000); measure-many one way QFA (MM-1QFA) and measure-many two-way QFA (MM-2QFA) introduced by Kondacs and Watrous (Proceedings of the 38th IEEE annual symposium on 433 foundations of computer science, 66---75, 1997); and measure-once two-way QFA (MO-2QFA) which were not given until now. The purpose of this work is mainly to discuss one kind of QFA, which is called MO-2QFA for brief. First of all, the definition of MO-2QFA is given and the conditions for preserving unitary properties are shown. Then, we analysis the basic algebraic properties of the class of languages which can be recognized by MO-2QFA, such as the union, intersection, complement and reversal operations. As well, we consider the catenation operation on the class of quantum languages recognized by MO-2QFA is closed in the generalized conditions.