On the languages accepted by finite reversible automata
14th International Colloquium on Automata, languages and programming
A lower bound for the nondeterministic space complexity of context-free recognition
Information Processing Letters
Quantum circuits with mixed states
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Quantum automata and quantum grammars
Theoretical Computer Science
Turing Machines with Sublogarithmic Space
Turing Machines with Sublogarithmic Space
Quantum computation and quantum information
Quantum computation and quantum information
One-way probabilistic reversible and quantum one-counter automata
Theoretical Computer Science
Lower Space Bounds for Randomized Computation
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
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
Quantum Reversibility and a New Model of Quantum Automaton
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On the power of quantum finite state automata
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Reversal complexity of counter machines
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Space-bounded quantum computation
Space-bounded quantum computation
On the complexity of simulating space-bounded quantum computations
Computational Complexity
Decidable and Undecidable Problems about Quantum Automata
SIAM Journal on Computing
Quantum versus deterministic counter automata
Theoretical Computer Science
Theory of Computing Systems
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Determining the equivalence for one-way quantum finite automata
Theoretical Computer Science
Various Aspects of Finite Quantum Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Efficient probability amplification in two-way quantum finite automata
Theoretical Computer Science
Computational Complexity: A Modern Approach
Computational Complexity: A Modern Approach
A new family of nonstochastic languages
Information Processing Letters
Unbounded-error quantum computation with small space bounds
Information and Computation
Languages recognized by nondeterministic quantum finite automata
Quantum Information & Computation
Hi-index | 0.00 |
In classical computation, a "write-only memory" (WOM) is little more than an oxymoron, and the addition of WOM to a (deterministic or probabilistic) classical computer brings no advantage. We prove that quantum computers that are augmented with WOM can solve problems that neither a classical computer with WOM nor a quantum computer without WOM can solve, when all other resource bounds are equal. We focus on realtime quantum finite automata, and examine the increase in their power effected by the addition of WOMs with different access modes and capacities. Some problems that are unsolvable by two-way probabilistic Turing machines using sublogarithmic amounts of read/write memory are shown to be solvable by these enhanced automata.