Alternating automata on infinite trees
Open Access
- 1 October 1987
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 54 (2-3) , 267-276
- https://doi.org/10.1016/0304-3975(87)90133-2
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- On alternating ω-automataJournal of Computer and System Sciences, 1988
- Alternation and ω-type Turing acceptorsTheoretical Computer Science, 1986
- Alternating finite automata on ω-wordsTheoretical Computer Science, 1984
- AlternationJournal of the ACM, 1981
- On equations for regular languages, finite automata, and sequential networksTheoretical Computer Science, 1980
- Borel DeterminacyAnnals of Mathematics, 1975