An upper bound on the complexity of recognizable tree languages (Q5501862): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 21:41, 5 March 2024
scientific article; zbMATH DE number 6472658
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
