Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages (Q3088053)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages
scientific article

    Statements

    Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages (English)
    0 references
    0 references
    0 references
    0 references
    17 August 2011
    0 references

    Identifiers