Language Recognition Power and Succinctness of Affine Automata (Q2819147): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs / 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: Looking for Pairs that Hard to Separate: A Quantum Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Affine Computation and Affine Automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unary probabilistic and quantum automata on promise problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3455037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential of Quantum Finite Automata with Exact Acceptance / 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: Space-Efficient Deterministic Simulation of Probabilistic 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: Probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implications of Quantum Automata for Contextuality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Finite Automata: A Modern Introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word-functions of stochastic and pseudo stochastic automata / 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: Q5414546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages Recognized with Unbounded Error by Quantum Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3171611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded-error quantum computation with small space bounds / rank
 
Normal rank

Latest revision as of 15:44, 12 July 2024

scientific article
Language Label Description Also known as
English
Language Recognition Power and Succinctness of Affine Automata
scientific article

    Statements

    Language Recognition Power and Succinctness of Affine Automata (English)
    0 references
    0 references
    0 references
    28 September 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    probabilistic automata
    0 references
    quantum automata
    0 references
    affine automata
    0 references
    state complexity
    0 references
    stochastic language
    0 references
    bounded-error
    0 references
    one-sided error
    0 references
    0 references
    0 references