On the languages accepted by finite reversible automata
14th International Colloquium on Automata, languages and programming
Rational series and their languages
Rational series and their languages
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Descriptional complexity issues in quantum computing
Journal of Automata, Languages and Combinatorics
Regular languages accepted by quantum automata
Information and Computation
Quantum automata and quantum grammars
Theoretical Computer Science
Analogies and differences between quantum and stochastic automata
Theoretical Computer Science
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
Probabilistic Reversible Automata and Quantum Automata
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
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
Optimal Lower Bounds for Quantum Automata and Random Access Codes
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Characterizations of 1-Way Quantum Finite Automata
Characterizations of 1-Way Quantum Finite Automata
Introduction to probabilistic automata (Computer science and applied mathematics)
Introduction to probabilistic automata (Computer science and applied mathematics)
Small size quantum automata recognizing some regular languages
Theoretical Computer Science - The art of theory
Some formal tools for analyzing quantum automata
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Quantum automata for some multiperiodic languages
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
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
Improved constructions of quantum automata
Theoretical Computer Science
On a class of languages recognizable by probabilistic reversible decide-and-halt automata
Theoretical Computer Science
Mathematical logic and quantum finite state automata
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
Multi-letter reversible and quantum finite automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Algebraic methods in quantum informatics
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Trace monoids with idempotent generators and measure-only quantum automata
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
Behaviours of Unary Quantum Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
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
Varieties generated by certain models of reversible finite automata
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Superiority of exact quantum automata for promise problems
Information Processing Letters
Journal of Computer and System Sciences
Quantum automata theory – a review
Algebraic Foundations in Computer Science
State succinctness of two-way finite automata with quantum and classical states
Theoretical Computer Science
| Hi-index | 0.01 |
In this paper we analyze several models of 1-way quantum finite automata, in the light of formal power series theory. In this general context, we recall two well known constructions, by proving: 1. Languages generated with isolated cut-point by a class of bounded rational formal series are regular. 2. If a class of formal series is closed under f-complement, Hadamard product and convex linear combination, then the class of languages generated with isolated cut-point is closed under boolean operations. We introduce a general model of 1-way quantum automata and we compare their behaviors with those of measure-once, measure-many and reversible 1-way quantum automata.