A note on the reduction of two-way automata to one-way atuomata
Information Processing Letters
A time complexity gap for two-way probabilistic finite-state automata
SIAM Journal on Computing
Finite state verifiers I: the power of interaction
Journal of the ACM (JACM)
Communication complexity
Handbook of formal languages, vol. 1
Descriptional complexity issues in quantum computing
Journal of Automata, Languages and Combinatorics
Quantum automata and quantum grammars
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
Dense quantum coding and quantum finite automata
Journal of the ACM (JACM)
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
Quantum communication and complexity
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
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Introduction to probabilistic automata (Computer science and applied mathematics)
Introduction to probabilistic automata (Computer science and applied mathematics)
Exponential separation of quantum and classical online space complexity
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Determination of equivalence between quantum sequential machines
Theoretical Computer Science
Determining the equivalence for one-way quantum finite automata
Theoretical 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
Improved constructions of quantum automata
Theoretical Computer Science
Hierarchy and equivalence of multi-letter quantum finite automata
Theoretical Computer Science
The reduction of two-way automata to one-way automata
IBM Journal of Research and Development
Quantum computing: 1-way quantum automata
DLT'03 Proceedings of the 7th 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
Characterizations of one-way general quantum finite automata
Theoretical Computer Science
Superiority of exact quantum automata for promise problems
Information Processing Letters
| Hi-index | 5.23 |
Two-way finite automata with quantum and classical states (2QCFA) were introduced by Ambainis and Watrous in 2002. In this paper we study state succinctness of 2QCFA. For any m@?Z^+ and any @e