Potential of Quantum Finite Automata with Exact Acceptance (Q2947961): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Dao Wen Qiu / rank
Normal rank
 
Property / author
 
Property / author: Dao Wen Qiu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1404.1689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-way finite automata with quantum and classical states. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense quantum coding and quantum finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved constructions of quantum automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superiority of exact quantum automata for promise problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small size quantum automata recognizing some regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some formal tools for analyzing quantum automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of 1-Way Quantum Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum algorithms revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapid solution of problems by quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved constructions of mixed state quantum automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of one-way general quantum finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum automata and quantum grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Quantum Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded-error quantum computation with small space bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: State succinctness of two-way finite automata with quantum and classical states / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the state complexity of semi-quantum finite automata / rank
 
Normal rank

Latest revision as of 20:43, 10 July 2024

scientific article
Language Label Description Also known as
English
Potential of Quantum Finite Automata with Exact Acceptance
scientific article

    Statements

    Potential of Quantum Finite Automata with Exact Acceptance (English)
    0 references
    0 references
    0 references
    0 references
    29 September 2015
    0 references
    0 references
    exact quantum computing
    0 references
    quantum finite automata
    0 references
    promise problems
    0 references
    state succinctness
    0 references
    0 references