On the complexity of minimizing probabilistic and quantum automata (Q690502): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59196664, #quickstatements; #temporary_batch_1710972793655
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Algorithms in real algebraic geometry / 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: Characterizations of 1-Way Quantum Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888536 / 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: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / 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: A note on quantum sequential machines / 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: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807665 / 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: Unbounded-error quantum computation with small space bounds / rank
 
Normal rank

Revision as of 21:54, 5 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of minimizing probabilistic and quantum automata
scientific article

    Statements

    On the complexity of minimizing probabilistic and quantum automata (English)
    0 references
    0 references
    0 references
    0 references
    27 November 2012
    0 references
    probabilistic automata
    0 references
    quantum automata
    0 references
    decidability
    0 references
    minimization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references