Quantum finite automata: advances on Bertoni's ideas
From MaRDI portal
(Redirected from Publication:517033)
Recommendations
Cites work
- scientific article; zbMATH DE number 4028925 (Why is no real title available?)
- scientific article; zbMATH DE number 3497764 (Why is no real title available?)
- scientific article; zbMATH DE number 3572058 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 2044497 (Why is no real title available?)
- scientific article; zbMATH DE number 2040892 (Why is no real title available?)
- scientific article; zbMATH DE number 1502104 (Why is no real title available?)
- scientific article; zbMATH DE number 1502111 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 1759400 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 1418357 (Why is no real title available?)
- scientific article; zbMATH DE number 3229565 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3346572 (Why is no real title available?)
- Algebraic characterization of the class of languages recognized by measure only quantum automata
- Algebraic results on quantum automata
- An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
- Analogies and differences between quantum and stochastic automata
- Behaviours of unary quantum automata
- Characterizations of 1-Way Quantum Finite Automata
- Complexity of promise problems on classical and quantum automata
- Decidable and Undecidable Problems about Quantum Automata
- Descriptional complexity -- an introductory survey
- GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA
- Generalizations of the distributed Deutsch-Jozsa promise problem
- Implications of quantum automata for contextuality
- Improved constructions of quantum automata
- Lower bounds on the size of quantum automata accepting unary languages.
- Membership problems for regular and context-free trace languages
- Normal forms for unary probabilistic automata
- Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
- On the Size of One-way Quantum Finite Automata with Periodic Behaviors
- On the decidability of the intersection problem for quantum automata and context-free languages
- On the power of one-way automata with quantum and classical states
- On the state complexity of semi-quantum finite automata
- One-way finite automata with quantum and classical states
- Probability Inequalities for Sums of Bounded Random Variables
- Quantum automata and periodic events
- Quantum automata and quantum grammars
- Quantum automata for some multiperiodic languages
- Quantum complexity theory
- Quantum computing.
- Quantum finite automata with control language
- Quantum information theory
- Quantum mechanical Hamiltonian models of Turing machines
- Quantum state complexity of formal languages
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Regular languages accepted by quantum automata
- Semantic alternatives in partial Boolean quantum logic
- Size lower bounds for quantum automata
- Small size quantum automata recognizing some regular languages
- Some formal tools for analyzing quantum automata.
- State complexity of operations on two-way finite automata over a unary alphabet
- Strengths and Weaknesses of Quantum Computing
- Superiority of exact quantum automata for promise problems
- The complexity of minimum difference cover
- The complexity of promise problems with applications to public-key cryptography
- Trace monoids with idempotent generators and measure-only quantum automata
- Two-way finite automata with quantum and classical states.
Cited in
(13)- scientific article; zbMATH DE number 7770052 (Why is no real title available?)
- The descriptional power of queue automata of constant length
- On finite automata with quantum and classical states
- Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers*
- Lifting query complexity to time-space complexity for two-way finite automata
- Mirrors and memory in quantum automata
- Quantum \(\omega\)-automata over infinite words and their relationships
- Improved constructions of quantum automata
- Characterization of tree automata based on quantum logic
- scientific article; zbMATH DE number 1948489 (Why is no real title available?)
- Relativizations of nonuniform quantum finite automata families
- Descriptional complexity of iterated uniform finite-state transducers
- scientific article; zbMATH DE number 6440119 (Why is no real title available?)
This page was built for publication: Quantum finite automata: advances on Bertoni's ideas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q517033)
