On the computational complexity of bisimulation, redux (Q703845)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the computational complexity of bisimulation, redux
scientific article

    Statements

    On the computational complexity of bisimulation, redux (English)
    0 references
    0 references
    0 references
    0 references
    11 January 2005
    0 references
    One-counter machines
    0 references
    Equivalence-checking
    0 references
    Model-checking
    0 references
    Automata
    0 references
    Formal languages
    0 references
    Bisimulation equivalence
    0 references
    Complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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
    0 references