Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning $\omega $-Machines (Q3779740)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning $\omega $-Machines |
scientific article |
Statements
Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning $\omega $-Machines (English)
0 references
1987
0 references
computational complexity
0 references
space oracle hierarchy
0 references
complete problems
0 references
finite automata
0 references
\(\omega \)-automata
0 references
alternating logspace hierarchy
0 references
oracle Turing machines
0 references
logspace alternation hierarchy
0 references
