Exact Affine Counter Automata (Q6114873): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Automata and quantum computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Looking for Pairs that Hard to Separate: A Quantum Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: k\(+1\) heads are better than k for PDAs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Affine Computation and Affine Automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite state verifiers I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3455037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on blind and partially blind one-way multicounter machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Power of Affine Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Las Vegas Automata by Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2893305 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error-free affine, unitary, and probabilistic OBDDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Affine automata verifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On quantum and probabilistic communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5016371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical and Quantum Counter Automata on Promise Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implications of Quantum Automata for Contextuality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multi-Head Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: QUANTUM COUNTER AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Finite Automata: A Modern Introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language Recognition Power and Succinctness of Affine Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superiority of one-way and realtime quantum machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum computation with write-only memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5414546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving the Power of Postselection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pumping lemma for deterministic context-free languages / rank
 
Normal rank

Revision as of 14:23, 2 August 2024

scientific article; zbMATH DE number 7726989
Language Label Description Also known as
English
Exact Affine Counter Automata
scientific article; zbMATH DE number 7726989

    Statements

    Exact Affine Counter Automata (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    15 August 2023
    0 references
    affine automata
    0 references
    counter automata
    0 references
    probabilistic automata
    0 references
    quantum automata
    0 references
    promise problems
    0 references
    Las Vegas algorithm
    0 references
    stateless automata
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers