Alternating automata, the weak monadic theory of trees and its complexity
- 1 April 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 97 (2) , 233-244
- https://doi.org/10.1016/0304-3975(92)90076-r
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On alternating ω-automataJournal of Computer and System Sciences, 1988
- Alternating automata on infinite treesTheoretical Computer Science, 1987
- Alternation and ω-type Turing acceptorsTheoretical Computer Science, 1986
- The theory of ends, pushdown automata, and second-order logicTheoretical Computer Science, 1985
- AlternationJournal of the ACM, 1981
- Weakly Definable Relations and Special AutomataPublished by Elsevier ,1970
- Testing and generating infinite sequences by a finite automatonInformation and Control, 1966
- Infinite sequences and finite machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1963