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

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Created claim: DBLP publication ID (P1635): journals/tcs/ZhengQGLM13, #quickstatements; #temporary_batch_1731483406851
 
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/tcs/ZhengQGLM13 / rank
 
Normal rank

Latest revision as of 08:41, 13 November 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