On the complexity of branching games with regular conditions (Q4608641)
From MaRDI portal
!
WARNING
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 6851911
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of branching games with regular conditions |
scientific article; zbMATH DE number 6851911 |
Statements
21 March 2018
0 references
stochastic games
0 references
meta-parity games
0 references
infinite trees
0 references
regular languages
0 references
parity automata
0 references
0.7814235091209412
0 references
0.7739619612693787
0 references
0.7723657488822937
0 references
0.7666541934013367
0 references
