Dense quantum coding and a lower bound for 1-way quantum automata
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Dense quantum coding and quantum finite automata
Journal of the ACM (JACM)
Computing with quanta-impacts of quantum theory on computation
Theoretical Computer Science - Natural computing
Two-way finite automata with quantum and classical states
Theoretical Computer Science - Natural computing
Exact Results for Accepting Probabilities of Quantum Automata
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Quantum and Stochastic Branching Programs of Bounded Width
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Upper Bounds on the Size of One-Way Quantum Finite Automata
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On the Class of Languages Recognizable by 1-Way Quantum Finite Automata
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Quantum versus Deterministic Counter Automata
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Automata: From Uncertainty to Quantum
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Probabilistic Reversible Automata and Quantum Automata
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Exact results for accepting probabilities of quantum automata
Theoretical Computer Science - Mathematical foundations of computer science
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
A theory of computation based on quantum logic (I)
Theoretical Computer Science
On the computational power of probabilistic and quantum branching program
Information and Computation
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
Complementing two-way finite automata
Information and Computation
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
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of 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
Improved Constructions of Quantum Automata
Theory of Quantum Computation, Communication, and Cryptography
A Bialgebraic Approach to Automata and Formal Language Theory
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
An application of quantum finite automata to interactive proof systems
Journal of Computer and System Sciences
Improved constructions of quantum automata
Theoretical Computer Science
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
Mathematical logic and quantum finite state 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
On the computational power of probabilistic and quantum branching program
Information and Computation
Quantum automata and algebraic groups
Journal of Symbolic Computation
Quantum computing: 1-way quantum automata
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Probabilities to accept languages by quantum finite automata
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Multi-letter reversible and quantum finite automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Computation in Sofic Quantum Dynamical Systems
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
Quantum computation with devices whose contents are never read
UC'10 Proceedings of the 9th international conference on Unconventional computation
Quantum finite state automata over infinite words
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
An Algebra of Automata That Includes Both Classical and Quantum Entities
Electronic Notes in Theoretical Computer Science (ENTCS)
Unbounded-error quantum computation with small space bounds
Information and Computation
Languages recognized by nondeterministic quantum finite automata
Quantum Information & Computation
Quantum automata, braid group and link polynomials
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
Complementing two-way finite automata
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Superiority of exact quantum automata for promise problems
Information Processing Letters
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
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
Quantum computation with write-only memory
Natural Computing: an international journal
Journal of Computer and System Sciences
On probabilistic and quantum reaction systems
Theoretical Computer Science
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
A theory of computation based on unsharp quantum logic: Finite state automata and pushdown automata
Theoretical Computer Science
On the complexity of minimizing probabilistic and quantum automata
Information and Computation
Computation in sofic quantum dynamical systems
UC'07 Proceedings of the 6th international conference on Unconventional Computation
Synthesis and optimization of reversible circuits—a survey
ACM Computing Surveys (CSUR)
State succinctness of two-way finite automata with quantum and classical states
Theoretical Computer Science
| Hi-index | 5.25 |