Topological complexity of context-free \(\omega \)-languages: a survey (Q5498741)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Topological complexity of context-free -languages: a survey |
scientific article; zbMATH DE number 6400515
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Topological complexity of context-free \(\omega \)-languages: a survey |
scientific article; zbMATH DE number 6400515 |
Statements
Topological Complexity of Context-Free ω-Languages: A Survey (English)
0 references
10 February 2015
0 references
infinite words
0 references
pushdown automata
0 references
context-free \(\omega\)-languages
0 references
\(\omega\)-powers
0 references
Cantor topology
0 references
topological complexity
0 references
Borel hierarchy
0 references
Wadge hierarchy
0 references
complete sets
0 references
decision problems
0 references
0.8641745448112488
0 references
0.8596329689025879
0 references
0.8578315377235413
0 references
0.8578315377235413
0 references
0.8551110625267029
0 references
