scientific article; zbMATH DE number 2040892
From MaRDI portal
Publication:4452048
Recommendations
Cited in
(51)- State succinctness of two-way finite automata with quantum and classical states
- Superiority of exact quantum automata for promise problems
- Languages Recognized with Unbounded Error by Quantum Finite Automata
- Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties
- Lower bounds on the size of semi-quantum finite automata
- Analysis of finite 1-qubit quantum automata unitary operators of which are rotations
- Unbounded-error quantum computation with small space bounds
- Size lower bounds for quantum automata
- Exponentially more concise quantum recognition of non-RMM regular languages
- Equivalence checking of quantum finite-state machines
- scientific article; zbMATH DE number 1839460 (Why is no real title available?)
- Lifting query complexity to time-space complexity for two-way finite automata
- scientific article; zbMATH DE number 1839459 (Why is no real title available?)
- Improved constructions of quantum automata
- Trace monoids with idempotent generators and measure-only quantum automata
- Implementation and Application of Automata
- Characterizations of one-way general quantum finite automata
- Learning quantum finite automata with queries
- Latvian quantum finite state automata for unary languages
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
- Mirrors and memory in quantum automata
- Another approach to the equivalence of measure-many one-way quantum finite automata and its application
- Some algebraic properties of measure-once two-way quantum finite automata
- One-way finite automata with quantum and classical states
- Hierarchy and equivalence of multi-letter quantum finite automata
- Complexity of promise problems on classical and quantum automata
- Complexity bounds of constant-space quantum computation
- On a class of languages recognizable by probabilistic reversible decide-and-halt automata
- Determining the equivalence for one-way quantum finite automata
- Quantum automata for some multiperiodic languages
- Small size quantum automata recognizing some regular languages
- Some formal tools for analyzing quantum automata.
- On hybrid models of quantum finite automata
- Algebraic Methods in Quantum Informatics
- Characterizations of 1-Way Quantum Finite Automata
- Automatic translation of quantum circuits to optimized one-way quantum computation patterns
- Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
- Quantum finite automata: a modern introduction
- Lower Bounds for Generalized Quantum Finite Automata
- On relation between linear temporal logic and quantum finite automata
- Quantum finite automata with control language
- Quantum combing
- Mathematical logic and quantum finite state automata
- Improved Constructions of Quantum Automata
- Undecidability on quantum finite automata
- Quantum finite automata: advances on Bertoni's ideas
- Some remarks on quantum automata
- Quantum automata theory -- a review
- On the intersection problem for quantum finite automata
- Preface
- State complexity of one-way quantum finite automata together with classical states
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452048)
