Alternation and ω-type Turing acceptors
- 31 December 1986
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 43, 107-115
- https://doi.org/10.1016/0304-3975(86)90170-2
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Alternating finite automata on ω-wordsTheoretical Computer Science, 1984
- AlternationJournal of the ACM, 1981
- On the complexity of ω-type Turing acceptorsTheoretical Computer Science, 1980
- Borel DeterminacyAnnals of Mathematics, 1975
- Decision problems forω-automataTheory of Computing Systems, 1969