Hierarchy and equivalence of multi-letter quantum finite automata (Q2271440): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Dao Wen Qiu / rank
Normal rank
 
Property / author
 
Property / author: Sheng Yu / rank
Normal rank
 
Property / author
 
Property / author: Dao Wen Qiu / rank
 
Normal rank
Property / author
 
Property / author: Sheng Yu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2009.03.040 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1834492313 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62049436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability on quantum finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452048 / 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: Multi-letter Reversible and Quantum Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence problem for deterministic multitape automata and transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum theory, the Church–Turing principle and the universal quantum computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum computational networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum computing. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: One way multihead deterministic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determination of equivalence between quantum sequential machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the equivalence for one-way 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: Q5643915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of sequential quantum machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata theory based on quantum logic: reversibilities and pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864428 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:25, 1 July 2024

scientific article
Language Label Description Also known as
English
Hierarchy and equivalence of multi-letter quantum finite automata
scientific article

    Statements

    Hierarchy and equivalence of multi-letter quantum finite automata (English)
    0 references
    7 August 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    quantum computing
    0 references
    multi-letter finite automata
    0 references
    quantum finite automata
    0 references
    equivalence
    0 references
    hierarchy
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references