State succinctness of two-way finite automata with quantum and classical states (Q391188): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59196655, #quickstatements; #temporary_batch_1712688784189
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1202.2651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic results on quantum automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-way finite automata with quantum and classical states. / 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: Improved constructions of quantum automata / 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: Q4452048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-complexity of finite-state devices, state compressibility and incompressibility / 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: A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite state verifiers I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / 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: 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: Quantum finite automata with control language / 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: Hierarchy and equivalence of multi-letter quantum finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5418251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the reduction of two-way automata to one-way automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum communication and complexity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encyclopedia of Complexity and Systems Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5414546 / 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
Property / cites work
 
Property / cites work: SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Way Finite Automata with Quantum and Classical States / rank
 
Normal rank

Revision as of 04:45, 7 July 2024

scientific article
Language Label Description Also known as
English
State succinctness of two-way finite automata with quantum and classical states
scientific article

    Statements

    State succinctness of two-way finite automata with quantum and classical states (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 January 2014
    0 references
    computing models
    0 references
    quantum finite automata
    0 references
    state complexity
    0 references
    state succinctness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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