Quantum finite automata: advances on Bertoni's ideas
From MaRDI portal
Publication:517033
DOI10.1016/j.tcs.2016.01.045zbMath1359.68159OpenAlexW2254370953MaRDI QIDQ517033
Maria Paola Bianchi, Beatrice Palano, Carlo Mereghetti
Publication date: 16 March 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.01.045
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
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 ⋮ Unnamed Item ⋮ The descriptional power of queue automata of constant length ⋮ Descriptional complexity of iterated uniform finite-state transducers ⋮ Characterization of tree automata based on quantum logic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Size lower bounds for quantum automata
- Superiority of exact quantum automata for promise problems
- State complexity of operations on two-way finite automata over a unary alphabet
- Improved constructions of quantum automata
- Quantum mechanical Hamiltonian models of Turing machines
- Semantic alternatives in partial Boolean quantum logic
- Quantum information theory
- Quantum computing.
- Quantum automata and quantum grammars
- Unary probabilistic and quantum automata on promise problems
- Membership problems for regular and context-free trace languages
- Two-way finite automata with quantum and classical states.
- Regular languages accepted by quantum automata
- Algebraic results on quantum automata
- The complexity of minimum difference cover
- Quantum automata for some multiperiodic languages
- Small size quantum automata recognizing some regular languages
- Some formal tools for analyzing quantum automata.
- Complexity of Promise Problems on Classical and Quantum Automata
- Generalizations of the distributed Deutsch–Jozsa promise problem
- Behaviours of Unary Quantum Automata
- Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
- Characterizations of 1-Way Quantum Finite Automata
- One-Way Finite Automata with Quantum and Classical States
- On the Power of One-Way Automata with Quantum and Classical States
- Implications of Quantum Automata for Contextuality
- Quantum finite automata with control language
- The complexity of promise problems with applications to public-key cryptography
- An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Strengths and Weaknesses of Quantum Computing
- Normal forms for unary probabilistic automata
- On the Size of One-way Quantum Finite Automata with Periodic Behaviors
- On the state complexity of semi-quantum finite automata
- ON THE DECIDABILITY OF THE INTERSECTION PROBLEM FOR QUANTUM AUTOMATA AND CONTEXT-FREE LANGUAGES
- Quantum complexity theory
- Algebraic Characterization of the Class of Languages Recognized by Measure Only Quantum Automata
- Decidable and Undecidable Problems about Quantum Automata
- Probability Inequalities for Sums of Bounded Random Variables
- Quantum State Complexity of Formal Languages
- GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA
- Theoretical Computer Science
- Analogies and differences between quantum and stochastic automata
- Trace monoids with idempotent generators and measure-only quantum automata
This page was built for publication: Quantum finite automata: advances on Bertoni's ideas
