Quantum State Complexity of Formal Languages (Q5500700): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2762497 / 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: Characterizations of 1-Way Quantum Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata that take advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering spheres with spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amount of nonconstructivity in deterministic finite automata / 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: Geometric arguments yield better bounds for threshold circuits and distributed computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds in Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and 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: Polynomial time quantum computation with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of quantum finite automata to interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-bounded quantum complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of simulating space-bounded quantum computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5414546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-way reversible and quantum finite automata with advice / 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 15:55, 10 July 2024

scientific article; zbMATH DE number 6471686
Language Label Description Also known as
English
Quantum State Complexity of Formal Languages
scientific article; zbMATH DE number 6471686

    Statements

    Quantum State Complexity of Formal Languages (English)
    0 references
    0 references
    0 references
    7 August 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    quantum finite automaton
    0 references
    quantum state complexity
    0 references
    approximate matrix rank
    0 references
    minimal automaton
    0 references
    advice
    0 references
    timed crossing sequence
    0 references
    permutation automaton
    0 references
    0 references