The Complexity of Enriched Mu-Calculi (Q3535618)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5365483
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Complexity of Enriched Mu-Calculi |
scientific article; zbMATH DE number 5365483 |
Statements
The Complexity of Enriched Mu-Calculi (English)
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
0 references
0 references
0 references
0.87381107
0 references
0.8655733
0 references
0.86455524
0 references
