A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
SIAM Journal on Computing
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
Connectivity and Reversibility in Automata
Journal of the ACM (JACM)
Inference of Reversible Languages
Journal of the ACM (JACM)
Quantum automata and quantum grammars
Theoretical Computer Science
Analogies and differences between quantum and stochastic automata
Theoretical Computer Science
Quantum computation and quantum information
Quantum computation and quantum information
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
Applications of Finite Automata
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
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
Characterizations of quantum automata
Theoretical Computer Science
Automata theory based on quantum logic: some characterizations
Information and Computation
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Logical reversibility of computation
IBM Journal of Research and Development
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
Automata theory based on complete residuated lattice-valued logic: Pushdown automata
Fuzzy Sets and Systems
Hierarchy and equivalence of multi-letter quantum finite automata
Theoretical Computer Science
Approximation of fuzzy context-free grammars
Information Sciences: an International Journal
Myhill--Nerode type theory for fuzzy languages and automata
Fuzzy Sets and Systems
Determinization of weighted finite automata over strong bimonoids
Information Sciences: an International Journal
Consequences and conjectures in preordered sets
Information Sciences: an International Journal
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Finite automata theory with membership values in lattices
Information Sciences: an International Journal
An improved algorithm for determinization of weighted and fuzzy automata
Information Sciences: an International Journal
Weighted automata and multi-valued logics over arbitrary bounded lattices
Theoretical Computer Science
A theory of computation based on unsharp quantum logic: Finite state automata and pushdown automata
Theoretical Computer Science
Automata theory based on complete residuated lattice-valued logic: Turing machines
Fuzzy Sets and Systems
Weighted nested word automata and logics over strong bimonoids
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Hi-index | 5.23 |
Automata theory based on quantum logic, called l-valued finite automata (l-VFAs), may be viewed as a logical approach to quantum computing. This work is mainly divided into two parts: one part deals with reversibility of l-VFAs, and the other establishes a basic framework of l-valued pushdown automata (l-VPDAs). First we provide some preliminaries concerning quantum logic and l-VFAs, and we prove a useful property of l-valued successor and source operators. Then we clarify the relationships between various reversibilities closely related to quantum finite automata in the literature. In particular, we define a reversibility of l-VFAs which is termed as retrievability, and we clarify the relationships between a number of different fashions regarding retrievability of l-VFAs. We prove that some of them are equivalent, but for the others to be equivalent the truth-value set is required to satisfy a certain condition. This is an essential difference from the classical situation. Afterwards, we introduce l-VPDAs and show that the class of the languages accepted by l-VPDAs by empty stack coincides with that accepted by l-VPDAs by final state. Finally, we provide some examples of l-VFAs and conclude with some remarks.