Checking NFA equivalence with bisimulations up to congruence (Q2931822)

From MaRDI portal
Revision as of 16:16, 23 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Checking NFA equivalence with bisimulations up to congruence
scientific article

    Statements

    Checking NFA equivalence with bisimulations up to congruence (English)
    0 references
    0 references
    0 references
    27 November 2014
    0 references
    antichain
    0 references
    automata
    0 references
    bisimulation
    0 references
    coinduction
    0 references
    congruence
    0 references
    language equivalence
    0 references
    up-to techniques
    0 references

    Identifiers