An upper bound on the complexity of recognizable tree languages (Q5501862)
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 6472658
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound on the complexity of recognizable tree languages |
scientific article; zbMATH DE number 6472658 |
Statements
An upper bound on the complexity of recognizable tree languages (English)
0 references
14 August 2015
0 references
infinite trees
0 references
tree automaton
0 references
regular tree language
0 references
Cantor topology
0 references
topological complexity
0 references
Borel hierarchy
0 references
game quantifier
0 references
wadge classes
0 references
wadge degrees
0 references
universal sets
0 references
provably-\(\Delta^{1}_{2}\)
0 references
0.8836507797241211
0 references
0.8308679461479187
0 references
0.8295564651489258
0 references
0.8172821402549744
0 references
0.8077427744865417
0 references
