Relational queries computable in polynomial time
Information and Control
Languages that capture complexity classes
SIAM Journal on Computing
Nondeterministic space is closed under complementation
SIAM Journal on Computing
On the relative complexity of some languages in NC
Information Processing Letters
Quantum circuits with mixed states
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Undecidability on quantum finite automata
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of 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
Two-way finite automata with quantum and classical states
Theoretical Computer Science - Natural computing
regular Languages Defined with Generalized Quantifiers
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
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
Mathematical logic and quantum finite state automata
Theoretical Computer Science
| Hi-index | 0.00 |
The connection between measure once quantum finite automata (MO-QFA) and logic is studied in this paper. The language class recognized by MO-QFA is compared to languages described by the first order logics and modular logics. And the equivalence between languages accepted by MO-QFA and languages described by formulas using Lindström quantifier is shown.