Deciding the topological complexity of Büchi languages (Q4598240)
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 6820288
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deciding the topological complexity of Büchi languages |
scientific article; zbMATH DE number 6820288 |
Statements
19 December 2017
0 references
tree automata
0 references
non-determinism
0 references
Borel sets
0 references
topological complexity
0 references
decidability
0 references
Deciding the topological complexity of Büchi languages * (English)
0 references
0.8336083889007568
0 references
0.8282694816589355
0 references
0.8058658838272095
0 references
0.8039117455482483
0 references
0.797636091709137
0 references
