The Complexity of Enriched Mu-Calculi (Q3535618)

From MaRDI portal
Revision as of 14:09, 12 October 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
The Complexity of Enriched Mu-Calculi
scientific article

    Statements

    The Complexity of Enriched Mu-Calculi (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 November 2008
    0 references
    decidability
    0 references
    complexity
    0 references
    fully enriched \(\mu \)-calculus
    0 references
    expressive fragments
    0 references
    satisfiability
    0 references
    ExpTime-complete
    0 references
    automata models
    0 references
    emptiness problems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references