On the Borel complexity of MSO definable sets of branches (Q3561217)
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 5711235
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Borel complexity of MSO definable sets of branches |
scientific article; zbMATH DE number 5711235 |
Statements
On the Borel Complexity of MSO Definable Sets of Branches (English)
0 references
25 May 2010
0 references
infinite words
0 references
trees
0 references
Borel hierarchy
0 references
automata
0 references
monadic second-order logic
0 references
0.7678616642951965
0 references
0.7496359944343567
0 references
0.7441655397415161
0 references
0.7417489290237427
0 references
0.739940345287323
0 references
