On the Complexity of the Equivalence Problem for Probabilistic Automata (Q2892790)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the Complexity of the Equivalence Problem for Probabilistic Automata
scientific article

    Statements

    On the Complexity of the Equivalence Problem for Probabilistic Automata (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 June 2012
    0 references

    Identifiers